期刊文献+

基于查询意图的长尾查询推荐 被引量:7

Long Tail Query Recommendation Based on Query Intent
下载PDF
导出
摘要 查询推荐是一种提升用户搜索效率的重要工具.传统的查询推荐方法关注频度较高的查询,但对于那些频度较低的长尾查询,由于其信息的稀疏性而难以产生好的推荐效果.另外,传统的方法由于没有考虑查询意图对推荐结果的影响,故对长尾查询的推荐会受到查询中噪声单词的影响.该文提出了一种新的关于词项查询图(term-query graph)概率混合模型,该模型能够准确地发掘出用户的查询意图.另外,文中还提出了一种融合查询意图的查询推荐方法,该方法可以将新查询中单词的推荐结果按查询意图自然地融合起来,从而避免了噪声单词对推荐结果的影响.实验结果表明,通过考虑查询意图,可以显著提高长尾查询推荐的相关性. Query recommendation is an important tool for improving searching efficiency. Tradi- tional recommendation methods were mainly care about the frequent queries, but cannot provide good recommendations for long tail queries due to the information sparsity. Without consideration of query intents, traditional methods generated the recommendations for long tail queries, which can be greatly influenced by noise words in queries. A novel probabilistic mixture model of termquery graph was proposed in this paper, which can clearly identify query intents of users. Otherwise, a new method of assembling query intents into recommendation was introduced in the paper, which can prevent the influence from noise words by merging the recommendations of word in newcoming query according to query intents naturally. The result of experiments show the rele-vance of long tail query recommendation can be greatly improved by taking account of query intent.
出处 《计算机学报》 EI CSCD 北大核心 2013年第3期636-642,共7页 Chinese Journal of Computers
基金 国家自然科学基金(60933005,61173008,61003166,61203298) 国家“九七三”重点基础研究发展规划项目基金(2012CB316303)资助~~
关键词 查询推荐 长尾查询 概率混合模型 查询意图 词项查询图 query recommendation long tail query probabilistic mixture model query intent term-query graph
  • 相关文献

参考文献18

  • 1Goel S, Broder A, Gabrilovich E, Pang B. Anatomy of thelong tail: Ordinary people with extraordinary tastes//Pro- ceedings of the ACM international conference on Web search and Data Mining. New York, USA, 2010:201-210.
  • 2Huh S, Fienberg S E. Discriminative topic modeling based on manifold learning//Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York, USA, 2010: 653-662.
  • 3Kawamae N, Takahashi K. Information retrieval based on collaborative fltering with latent interest semantic map// Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery in Data Mining. New York, USA, 2005: 618-623.
  • 4Mei Q, Cai D, Zhang D, Zhai C. Topic modeling with net- work regularization//Proceedings of the International Conference on World Wide Web. New York, USA, 2008: 101- 110.
  • 5Hofmann T. Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 2001, 42(1-2): 177-196.
  • 6Blei D M, Ng A Y, Jordan M I, Lafferty J. Latent dirichlet allocation. The Journal of Machine Learning Research, 2003, 3:993- 1022.
  • 7Newman M E J, Leicht E A. Mixture models and explorato- ry analysis in networks. Proceedings of the National Aeade my of Sciences, 2007, 104(23) : 9564-9569.
  • 8Ramasco J J, Mungan M. Inversion method for content- based networks. Physical Review E, 2008, 77(3): 036122.
  • 9Ren W, Yah G, Liao X. A simple probabilistic algorithm for detecting community structure in social networks. Physical Review E, 2009, 79(3): 036111.
  • 10Mei Q, Zhou D, Church K. Query suggestion using hitting time//Proceedings of the ACM Conference on Information and Knowledge Management. New York, USA, 2008:469-478.

同被引文献73

引证文献7

二级引证文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部