Intent-aware query similarity

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2011, Pages 259-268

  Guo, Jiafeng ^a   Cheng, Xueqi ^a   Xu, Gu ^b   Zhu, Xiaofei ^a  

^a INSTITUTE OF COMPUTING TECHNOLOGY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

graph based measure; pair wise measure; query similarity; regularized topic model; search intent

Indexed keywords

GRAPH-BASED; PAIR-WISE MEASURE; QUERY SIMILARITY; SEARCH INTENT; TOPIC MODEL;

KNOWLEDGE MANAGEMENT;

EID: 83055181838     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2063576.2063619     Document Type: Conference Paper

References (35)

1. I. Antonellis, H. G. Molina, and C. C. Chang. Simrank++: query rewriting through link analysis of the click graph. Proc. VLDB Endow., 1:408-421, August 2008.
2. R. A. Baeza-Yates, C. A. Hurtado, and M. Mendoza. Query recommendation using query logs in search engines. In W. Lindner, M. Mesiti, C. Tĺźrker, Y. Tzitzikas, and A. Vakali, editors, EDBT Workshops, volume 3268 of Lecture Notes in Computer Science, pages 588-596. Springer, 2004.
3. D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '00, pages 407-416, New York, NY, USA, 2000. ACM.
4. M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems, 14:585-591, 2001.
5. D. M. Blei and J. D. Lafferty. Dynamic topic models. In Proceedings of the 23rd international conference on Machine learning, ICML '06, pages 113-120, New York, NY, USA, 2006. ACM.
6. D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. J. Mach. Learn. Res., 3:993-1022, March 2003.
7. P. Boldi, F. Bonchi, C. Castillo, D. Donato, A. Gionis, and S. Vigna. The query-flow graph: model and applications. In Proceeding of the 17th ACM conference on Information and knowledge management, CIKM '08, pages 609-618, New York, NY, USA, 2008. ACM.
8. P. Boldi, F. Bonchi, C. Castillo, D. Donato, and S. Vigna. Query suggestions using query-flow graphs. In Proceedings of the 2009 workshop on Web Search Click Data, WSCD '09, pages 56-63, New York, NY, USA, 2009. ACM.
9. I. Bordino, C. Castillo, D. Donato, and A. Gionis. Query similarity by projecting the query-flow graph. In Proceeding of the 33rd international ACM SIGIR conference on Research and development in information retrieval, SIGIR '10, pages 515-522, New York, NY, USA, 2010. ACM.
10. D. Cai, Q. Mei, J. Han, and C. Zhai. Modeling hidden topics on document manifold. In Proceeding of the 17th ACM conference on Information and knowledge management, CIKM '08, pages 911-920, New York, NY, USA, 2008. ACM.
11. D. Cai, X. Wang, and X. He. Probabilistic dyadic data analysis with local and global consistency. In Proceedings of the 26th Annual International Conference on Machine Learning, ICML '09, pages 105-112, New York, NY, USA, 2009. ACM.
12. B. Cao, J.-T. Sun, E. W. Xiang, D. H. Hu, Q. Yang, and Z. Chen. Pqc: personalized query classification. In Proceeding of the 18th ACM conference on Information and knowledge management, CIKM '09, pages 1217-1226, New York, NY, USA, 2009. ACM.
13. N. Craswell and M. Szummer. Random walks on the click graph. In Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '07, pages 239-246, New York, NY, USA, 2007. ACM.
14. H. Cui, J.-R. Wen, J.-Y. Nie, and W.-Y. Ma. Query expansion by mining user logs. IEEE Trans. on Knowl. and Data Eng., 15:829-839, July 2003.
15. A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B(39):1-38, 1977.
16. H. Deng, I. King, and M. R. Lyu. Entropy-biased models for query representation on the click graph. In Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, SIGIR '09, pages 339-346, New York, NY, USA, 2009. ACM.
17. L. Fitzpatrick and M. Dent. Automatic feedback using past queries: social searching? In Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '97, pages 306-313, New York, NY, USA, 1997. ACM.
18. T. L. Griffiths, M. Steyvers, D. M. Blei, and J. B. Tenenbaum. Integrating topics and syntax. In In Advances in Neural Information Processing Systems 17, pages 537-544. MIT Press, 2005.
19. J. Guo, X. Cheng, G. Xu, and H. Shen. A structured approach to query recommendation with social annotation data. In Proceedings of the 19th ACM international conference on Information and knowledge management, CIKM '10, pages 619-628, New York, NY, USA, 2010. ACM.
20. J. Guo, G. Xu, X. Cheng, and H. Li. Named entity recognition in query. In Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval, SIGIR '09, pages 267-274, New York, NY, USA, 2009. ACM.
21. T. Hofmann. Probabilistic latent semantic indexing. In Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '99, pages 50-57, New York, NY, USA, 1999. ACM.
22. R. Jones, B. Rey, O. Madani, and W. Greiner. Generating query substitutions. In Proceedings of the 15th international conference on World Wide Web, WWW '06, pages 387-396, New York, NY, USA, 2006. ACM.
23. Y. Li, Z. Zheng, and H. K. Dai. Kdd cup-2005 report: facing a great challenge. SIGKDD Explor. Newsl., 7:91-99, December 2005.
24. H. Ma, H. Yang, I. King, and M. R. Lyu. Learning latent semantic relations from clickthrough data for query suggestion. In Proceeding of the 17th ACM conference on Information and knowledge management, CIKM '08, pages 709-718, New York, NY, USA, 2008. ACM.
25. Q. Mei, D. Cai, D. Zhang, and C. Zhai. Topic modeling with network regularization. In Proceeding of the 17th international conference on World Wide Web, WWW '08, pages 101-110, New York, NY, USA, 2008. ACM.
26. Q. Mei, D. Zhou, and K. Church. Query suggestion using hitting time. In Proceeding of the 17th ACM conference on Information and knowledge management, CIKM '08, pages 469-478, New York, NY, USA, 2008. ACM.
27. R. M. Neal and G. E. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants, pages 355-368. MIT Press, Cambridge, MA, USA, 1999.
28. W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical recipes in C: the art of scientific computing. Cambridge University Press, New York, NY, USA, 1992.
29. F. Radlinski, A. Broder, P. Ciccolo, E. Gabrilovich, V. Josifovski, and L. Riedel. Optimizing relevance and revenue in ad search: a query substitution approach. In Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '08, pages 403-410, New York, NY, USA, 2008. ACM.
30. M. Sahami and T. D. Heilman. A web-based kernel function for measuring the similarity of short text snippets. In Proceedings of the 15th international conference on World Wide Web, WWW '06, pages 377-386, New York, NY, USA, 2006. ACM.
31. M. Steyvers, P. Smyth, M. Rosen-Zvi, and T. Griffiths. Probabilistic author-topic models for information discovery. In The Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004.
32. E. Terra and C. L. Clarke. Scoring missing terms in information retrieval tasks. In Proceedings of the thirteenth ACM international conference on Information and knowledge management, CIKM '04, pages 50-58, New York, NY, USA, 2004. ACM.
33. J.-R. Wen, J.-Y. Nie, and H. Zhang. Query clustering using user logs. ACM Trans. Inf. Syst., 20(1):59-81, 2002. (Pubitemid 44642307)
34. Z. Zhang and O. Nasraoui. Mining search engine query logs for query recommendation. In Proceedings of the 15th international conference on World Wide Web, WWW '06, pages 1039-1040, New York, NY, USA, 2006. ACM.
35. Y. Zhao and G. Karypis. Criterion functions for document clustering: Experiments and analysis. Technical report, 2002.