Abstract
Query clustering is a process used to discover frequently asked questions or most popular topics on a search engine. This process is crucial for search engines based on question-answering. Because of the short lengths of queries, approaches based on keywords are not suitable for query clustering. This paper describes a new query clustering method that makes use of user logs which allow us to identify the documents the users have selected for a query. The similarity between two queries may be deduced from the common documents the users selected for them. Our experiments show that a combination of both keywords and user logs is better than using either method alone.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,General Business, Management and Accounting,Information Systems
Reference21 articles.
1. BEEFERMAN D.AND BERGER A. 2000. Agglomerative clustering of a search engine query log. In Proceedings of the 6th ACMSIGKDD International Conference on Knowledge Discovery and Data Mining (August). Acm Press New York NY 407-416. 10.1145/347090.347176
2. DUBES R.C.AND JAIN A. K. 1988. Algorithms for Clustering Data. Prentice-Hall Englewood Cliffs NJ.
3. ESTER M. KRIEGEL H. SANDER J. AND XU X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. 226-231.
4. ESTER M. KRIEGEL H. SANDER J. WIMMER M. AND XU X. 1998. Incremental clustering for mining in a data warehousing environment. In Proceedings of the 24th International Conference on Very Large Data Bases 323-333.
5. FITZPATRICK L.AND DENT M. 1997. Automatic feedback using past queries: social searching? In Proceedings of the 20th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM Press New York NY 306-312. 10.1145/258525.258597
Cited by
170 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献