]> BibSonomy publications for/author/Ziviani ADHOC-NOWconf/adhoc-now/200829-42Lecture Notes in Computer ScienceMitigating Reply Implosions in Query-Based Service Discovery Protocols for Mobile Wireless Ad Hoc Networks.51982008dblp 2008-10-01 00:00:00.0 ACM Trans. Inf. Syst.142-63Local versus global link information in the Web.212003InformationRetrieval LinkAnalysis WebSearch link toread web 2008-09-08 12:39:10.0 New York, NY, USACIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management696--703Concept-based interactive query expansion2005QueryExpansion query toread 2008-09-01 17:34:19.0Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are still many situations in which the users are presented with imprecise or very poor results. One of the key difficulties is the fact that users usually submit very short and ambiguous queries, and they do not fully specify their information needs. That is, it is necessary to improve the query formation process if better answers are to be provided. In this work we propose a novel concept-based query expansion technique, which allows disambiguating queries submitted to search engines. The concepts are extracted by analyzing and locating cycles in a special type of query relations graph. This is a directed graph built from query relations mined using association rules. The concepts related to the current query are then shown to the user who selects the one concept that he interprets is most related to his query. This concept is used to expand the original query and the expanded query is processed instead. Using a Web test collection, we show that our approach leads to gains in average precision figures of roughly 32%. Further, if the user also provides information on the type of relation between his query and the selected concept, the gains in average precision go up to roughly 52%. SIGCSE Bulletin2135-145Assessing the research and education quality of the top Brazilian Computer Science graduate programs.402008dblp 2008-06-27 00:00:00.0 SIGIRconf/sigir/2005663-664A retrospective study of probabilistic context-based retrieval.2005dblp 2008-06-19 00:00:00.0 JCDLconf/jcdl/2008295-304Using web information for creating publication venue authority files.2008dblp 2008-06-17 00:00:00.0 WWWconf/www/2008367-376Genealogical trees on the web: a search engine user perspective.2008dblp 2008-05-13 00:00:00.0 New York, NY, USACIKM '05: Proceedings of the 14th ACM international conference on Information and knowledge management696--703Concept-based interactive query expansion2005TOREAD query-log-analysis recommender 2008-04-23 11:21:02.0Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are still many situations in which the users are presented with imprecise or very poor results. One of the key difficulties is the fact that users usually submit very short and ambiguous queries, and they do not fully specify their information needs. That is, it is necessary to improve the query formation process if better answers are to be provided. In this work we propose a novel concept-based query expansion technique, which allows disambiguating queries submitted to search engines. The concepts are extracted by analyzing and locating cycles in a special type of query relations graph. This is a directed graph built from query relations mined using association rules. The concepts related to the current query are then shown to the user who selects the one concept that he interprets is most related to his query. This concept is used to expand the original query and the expanded query is processed instead. Using a Web test collection, we show that our approach leads to gains in average precision figures of roughly 32%. Further, if the user also provides information on the type of relation between his query and the selected concept, the gains in average precision go up to roughly 52%. LA-WEBconf/la-web/200366-71Using Association Rules to Discover Search Engines Related Queries.2003AssociationRules SearchEngineQuery query 2008-03-19 15:28:21.0 Encyclopedia of Multimediareference/mm/2006Video Over IP.2006dblp 2008-02-24 00:00:00.0