Search (2 results, page 1 of 1)
- Did you mean:
- author's%3a%22Gilliland-swetland%2c A.%22 2
- author's%3a%22Gilliland-scotland%2c A.%22 2
- authors%3a%22Gilliland-swetland%2c A.%22 2
- author's%3a%22Gilliland-seland%2c A.%22 2
- authors%3a%22Gilliland-scotland%2c A.%22 2
-
Cai, F.; Rijke, M. de: Learning from homologous queries and semantically related terms for query auto completion (2016)
0.00
0.002149515 = product of: 0.00429903 = sum of: 0.00429903 = product of: 0.00859806 = sum of: 0.00859806 = weight(_text_:a in 2971) [ClassicSimilarity], result of: 0.00859806 = score(doc=2971,freq=16.0), product of: 0.04772363 = queryWeight, product of: 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.041389145 = queryNorm 0.18016359 = fieldWeight in 2971, product of: 4.0 = tf(freq=16.0), with freq of: 16.0 = termFreq=16.0 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.0390625 = fieldNorm(doc=2971) 0.5 = coord(1/2) 0.5 = coord(1/2)
- Abstract
- Query auto completion (QAC) models recommend possible queries to web search users when they start typing a query prefix. Most of today's QAC models rank candidate queries by popularity (i.e., frequency), and in doing so they tend to follow a strict query matching policy when counting the queries. That is, they ignore the contributions from so-called homologous queries, queries with the same terms but ordered differently or queries that expand the original query. Importantly, homologous queries often express a remarkably similar search intent. Moreover, today's QAC approaches often ignore semantically related terms. We argue that users are prone to combine semantically related terms when generating queries. We propose a learning to rank-based QAC approach, where, for the first time, features derived from homologous queries and semantically related terms are introduced. In particular, we consider: (i) the observed and predicted popularity of homologous queries for a query candidate; and (ii) the semantic relatedness of pairs of terms inside a query and pairs of queries inside a session. We quantify the improvement of the proposed new features using two large-scale real-world query logs and show that the mean reciprocal rank and the success rate can be improved by up to 9% over state-of-the-art QAC models.
- Type
- a
-
Meij, E.; Rijke, M. de: Thesaurus-based feedback to support mixed search and browsing environments (2007)
0.00
0.0020106873 = product of: 0.0040213745 = sum of: 0.0040213745 = product of: 0.008042749 = sum of: 0.008042749 = weight(_text_:a in 2432) [ClassicSimilarity], result of: 0.008042749 = score(doc=2432,freq=14.0), product of: 0.04772363 = queryWeight, product of: 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.041389145 = queryNorm 0.1685276 = fieldWeight in 2432, product of: 3.7416575 = tf(freq=14.0), with freq of: 14.0 = termFreq=14.0 1.153047 = idf(docFreq=37942, maxDocs=44218) 0.0390625 = fieldNorm(doc=2432) 0.5 = coord(1/2) 0.5 = coord(1/2)
- Abstract
- We propose and evaluate a query expansion mechanism that supports searching and browsing in collections of annotated documents. Based on generative language models, our feedback mechanism uses document-level annotations to bias the generation of expansion terms and to generate browsing suggestions in the form of concepts selected from a controlled vocabulary (as typically used in digital library settings). We provide a detailed formalization of our feedback mechanism and evaluate its effectiveness using the TREC 2006 Genomics track test set. As to the retrieval effectiveness, we find a 20% improvement in mean average precision over a query-likelihood baseline, whilst increasing precision at 10. When we base the parameter estimation and feedback generation of our algorithm on a large corpus, we also find an improvement over state-of-the-art relevance models. The browsing suggestions are assessed along two dimensions: relevancy and specifity. We present an account of per-topic results, which helps understand for what type of queries our feedback mechanism is particularly helpful.
- Type
- a