Bringing order to the Web: automatically categorizing search results
Proceedings of the SIGCHI conference on Human Factors in Computing Systems
Agglomerative clustering of a search engine query log
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering user queries of a search engine
Proceedings of the 10th international conference on World Wide Web
Subject categorization of query terms for exploring Web users' search interests
Journal of the American Society for Information Science and Technology
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM SIGIR Forum
Learning to cluster web search results
Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval
HLT '91 Proceedings of the workshop on Speech and Natural Language
Fast webpage classification using URL features
Proceedings of the 14th ACM international conference on Information and knowledge management
KDD CUP-2005 report: facing a great challenge
ACM SIGKDD Explorations Newsletter
Improving web search ranking by incorporating user behavior information
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Clustering of search results using temporal attributes
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
Learn from web search logs to organize search results
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Robust classification of rare queries using web knowledge
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Random walks on the click graph
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Supporting multiple information-seeking strategies in a single system framework
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
Varying approaches to topical web query classification
SIGIR '07 Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval
A personalized search engine based on Web-snippet hierarchical clustering
Software—Practice & Experience
Context-aware query suggestion by mining click-through and session data
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs
Proceedings of the 17th ACM conference on Information and knowledge management
A dynamic bayesian network click model for web search ranking
Proceedings of the 18th international conference on World wide web
A survey of Web clustering engines
ACM Computing Surveys (CSUR)
A comparison of extrinsic clustering evaluation metrics based on formal constraints
Information Retrieval
Entropy-biased models for query representation on the click graph
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Inferring query intent from reformulations and clicks
Proceedings of the 19th international conference on World wide web
Proceedings of the fourth ACM international conference on Web search and data mining
Click-graph modeling for facet attribute estimation of web search queries
RIAO '10 Adaptivity, Personalization and Fusion of Heterogeneous Information
Semantic search log k-anonymization with generalized k-cores of query concept graph
ECIR'13 Proceedings of the 35th European conference on Advances in Information Retrieval
Extracting query facets from search results
Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
A probabilistic mixture model for mining and analyzing product search log
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Dynamic query intent mining from a search log stream
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Mining search and browse logs for web search: A Survey
ACM Transactions on Intelligent Systems and Technology (TIST) - Survey papers, special sections on the semantic adaptive social web, intelligent systems for health informatics, regular papers
Heterogeneous graph-based intent learning with queries, web pages and Wikipedia concepts
Proceedings of the 7th ACM international conference on Web search and data mining
Improving search relevance for short queries in community question answering
Proceedings of the 7th ACM international conference on Web search and data mining
Hi-index | 0.00 |
Most queries in web search are ambiguous and multifaceted. Identifying the major senses and facets of queries from search log data, referred to as query subtopic mining in this paper, is a very important issue in web search. Through search log analysis, we show that there are two interesting phenomena of user behavior that can be leveraged to identify query subtopics, referred to as `one subtopic per search' and `subtopic clarification by keyword'. One subtopic per search means that if a user clicks multiple URLs in one query, then the clicked URLs tend to represent the same sense or facet. Subtopic clarification by keyword means that users often add an additional keyword or keywords to expand the query in order to clarify their search intent. Thus, the keywords tend to be indicative of the sense or facet. We propose a clustering algorithm that can effectively leverage the two phenomena to automatically mine the major subtopics of queries, where each subtopic is represented by a cluster containing a number of URLs and keywords. The mined subtopics of queries can be used in multiple tasks in web search and we evaluate them in aspects of the search result presentation such as clustering and re-ranking. We demonstrate that our clustering algorithm can effectively mine query subtopics with an F1 measure in the range of 0.896-0.956. Our experimental results show that the use of the subtopics mined by our approach can significantly improve the state-of-the-art methods used for search result clustering. Experimental results based on click data also show that the re-ranking of search result based on our method can significantly improve the efficiency of users' ability to find information.