Title
Learning query ambiguity models by using search logs
Abstract
Identifying ambiguous queries is crucial to research on personalized Web search and search result diversity. Intuitively, query logs contain valuable information on how many intentions users have when issuing a query. However, previous work showed user clicks alone are misleading in judging a query as being ambiguous or not. In this paper, we address the problem of learning a query ambiguity model by using search logs. First, we propose enriching a query by mining the documents clicked by users and the relevant follow up queries in a session. Second, we use a text classifier to map the documents and the queries into predefined categories. Third, we propose extracting features from the processed data. Finally, we apply a state-of-the-art algorithm, Support Vector Machine (SVM), to learn a query ambiguity classifier. Experimental results verify that the sole use of click based features or session based features perform worse than the previous work based on top retrieved documents. When we combine the two sets of features, our proposed approach achieves the best effectiveness, specifically 86% in terms of accuracy. It significantly improves the click based method by 5.6% and the session based method by 4.6%.
Year
DOI
Venue
2010
10.1007/s11:190-010-1056-9
J. Comput. Sci. Technol.
Keywords
Field
DocType
ambiguous query,log mining,query classification
Query optimization,Web search query,Query language,Query expansion,Information retrieval,Computer science,Sargable,Web query classification,Ranking (information retrieval),Spatial query
Journal
Volume
Issue
ISSN
25
4
1860-4749
Citations 
PageRank 
References 
3
0.51
18
Authors
4
Name
Order
Citations
PageRank
Ruihua Song1113859.33
Zhicheng Dou270641.96
Hsiao-Wuen Hon31719354.37
Yong Yu47637380.66