Topical query decomposition

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 52-60

  Bonchi, Francesco ^a   Castillo, Carlos ^a   Donato, Debora ^a   Gionis, Aristides ^a  

^a YAHOO RESEARCH   (Spain)

Author keywords

Clustering; Query recommendation; Set cover

Indexed keywords

CLUSTERING; CONSTRAINED CLUSTERING; DOCUMENT RETRIEVALS; GREEDY ALGORITHMS; HIERARCHICAL AGGLOMERATIVE CLUSTERING; QUERY DECOMPOSITIONS; QUERY RECOMMENDATION; SET COVER; SET COVER PROBLEMS; TWO-PHASE ALGORITHMS;

INFORMATION MANAGEMENT; MINING; SEARCH ENGINES; SYSTEMS ENGINEERING; WORLD WIDE WEB;

INFORMATION RETRIEVAL;

EID: 65449115787     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401902     Document Type: Conference Paper

References (29)

1. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999.
2. R. A. Baeza-Yates, C. A. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In Proc. of EDBT Workshops, pp. 588-596, 2004.
3. S. Basu, I. Davidson, and K. Wagstaff, editors. Constrained Clustering: Advances in Algorithms, Theory and Applications. Chapman & Hall/CRC Press, Data Mining and Knowledge Discovery Series, 2008. (In press).
4. D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In Proc. of ACM Int. Conf. on Knowledge Discovery and Data Mining (KDD), 2000.
5. N. J. Belkin. The human element: helping people find what they don't know. Communications of the ACM, 43(8), 2000.
6. R. D. Carr, S. Doddi, G. Konjevod, and M. V. Marathe. On the red-blue set cover problem. In Proc. of Symposium on Discrete Algorithms, 2000.
7. V. Chvátal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 4:233-235, 1979.
8. N. Craswell, O. Zoeter, M. Taylor, and B. Ramsey. An experimental comparison of click position-bias models. In Proc. of Int. Conf. on Web Search and Web Data Mining (WSDM), 2008.
9. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of ACM Int. Conf. on Knowledge Discovery and Data Mining (KDD), 1996.
10. U. Feige. A threshold of Inn for approximating set cover. Journal of the ACM, 45(4):634-652, 1998.
11. P. Ferragina and A. Gulli. A personalized search engine based on web-snippet hierarchical clustering. In Proc. of World Wide Web Conf. (WWW), 2005.
12. B. M. Fonseca, P. B. Golgher, E. S. de Moura, B. Pôssas, and N. Ziviani. Discovering search engine related queries using association rules. Journal of Web Engineering, 2(4), 2004.
13. B. M. Fonseca, P. B. Golgher, B. Pôssas, B. A. Ribeiro-Neto, and N. Ziviani. Concept-based interactive query expansion. In Proc. of ACM Int. Conf. on Information and Knowledge Management (CIKM), 2005.
14. M. A. Hearst and J. O. Pedersen. Reexamining the cluster hypothesis: Scatter/gather on retrieval results. In Proc. of ACM Int. Conf. on Information Retrieval (SIGIR), 1996.
15. B. J. Jansen and A. Spink. How are we searching the world wide web? a comparison of nine search engine transaction logs. Information Processing & Management, 42(1):248-263, January 2006.
16. D. Johnson. Approximation algorithms for combinatorial problems. In Proc. of the ACM Symposium on Theory of Computing, 1973.
17. K. Kummamuru, R. Lotlikar, S. Roy, K. Singal, and R. Krishnapuram. A hierarchical monothetic document clustering algorithm for summarization and browsing search results. In Proc. of World Wide Web Conf. (WWW), 2004.
18. D. Peleg. Approximation algorithms for the label-covermax and red-blue set cover problems. Journal of Discrete Algorithms, 5(1):55-64, 2007.
19. B. Poblete and R. Baeza-Yates. Query-sets: Using implicit feedback and query patterns to organize web documents. In Proc. of World Wide Web Conf. (WWW), 2008.
20. B. Pôssas, N. Ziviani, W. Meira, and B. Ribeiro-Neto. Set-based model: a new approach for information retrieval. In Proc. of ACM Int. Conf. on Information Retrieval (SIGIR), 2002.
21. P.-N. Tan, M. Steinbach, and V. Kumar. Introduction to Data Mining. Addison-Wesley, 2005.
22. V. Vazirani. Approximation Algorithms. Springer, 2004.
23. K. Wagstaff, S. Basu, and I. Davidson. When is constrained clustering beneficial, and why? In Proc. of AAAAI'06, 2006.
24. K. Wagstaff, C. Cardie, S. Rogers, and S. Schrödl. Constrained k-means clustering with background knowledge. In Proc. of Int. Conf. on Machine Learning (ICML), 2001.
25. J.-R. Wen, J.-Y. Nie, H.-J. Zhang, and H.-J. Zhang. Clustering user queries of a search engine. In Proc. of World Wide Web Conf. (WWW), 2001.
26. J. Xu and W. B. Croft. Improving the effectiveness of information retrieval with local context analysis. ACM Transact. on Information Systems, 18(1):79-112, 2000.
27. H. Zeng, Q. He, Z. Chen, and W. Ma. Learning to cluster web search results. In Proc. of ACM Int. Conf. on Information Retrieval (SIGIR), 2004.
28. Z. Zhang and O. Nasraoui. Mining search engine query logs for query recommendation. In Proc. of World Wide Web Conf. (WWW), 2006.
29. Y. Zhao and G. Karypis. Evaluation of hierarchical clustering algorithms for document datasets. In Proc. of ACM Int. Conf. on Information and Knowledge Management (CIKM), pp. 515-524, 2002.