Query ranking model for search engine query recommendation

被引:5
|
作者
Wang, JianGuo [1 ,2 ]
Huang, Joshua Zhexue [3 ]
Guo, Jiafeng [4 ]
Lan, Yanyan [4 ]
机构
[1] Chinese Acad Sci, Shenzhen Univ Town, Shenzhen Inst Adv Technol, Shenzhen Key Lab High Performance Data Min, 1068 Xueyuan Ave, Shenzhen 518055, Peoples R China
[2] Univ Chinese Acad Sci, Shenzhen Coll Adv Technol, Shenzhen, Peoples R China
[3] Shenzhen Univ, Coll Comp Sci & Software Engn, 3688 Nanhai Ave, Shenzhen 518060, Peoples R China
[4] Chinese Acad Sci, Inst Comp Technol, 6 Kexueyuan South Rd, Beijing 100190, Peoples R China
基金
中国国家自然科学基金;
关键词
Query recommendation; Query log analysis; Query ranking; Recommendation methods;
D O I
10.1007/s13042-015-0362-5
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose a query ranking model to select and order queries for search engine query recommendations. In contrast to existing similarity-based query recommendation methods (Agglomerative clustering of a search engine query log, 2000; The query-flow graph: model and applications, 2008], this model is based on utility, and ranks a query based on the joint probability of events whereby a query is selected by the user, the search results of the query are selected by the user, and the chosen search results satisfy the user's information needs. We thus define three utilities in our model: a query-level utility representing the attractiveness of a query to the user, a perceived utility measuring the user's actions given the search results, and a posterior utility measuring the user's satisfaction with the chosen search results. We propose methods to compute these three utilities from query log data. In experiments involving real query log data, our proposed query ranking model outperformed seven other baseline methods in generating useful recommendations.
引用
收藏
页码:1019 / 1038
页数:20
相关论文
共 50 条
  • [31] Bilingual search engine augmented with query expansion
    Facundes, Nuttanart
    Theva-aksorn, Ratchaneekorn
    PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, 2007, : 765 - 770
  • [32] Investigating query bursts in a web search engine
    Subašić, Ilija
    Castillo, Carlos
    Web Intelligence and Agent Systems, 2013, 11 (02): : 107 - 124
  • [33] Using a search engine to query a relational database
    Hanington, Brian
    Brazile, Robert
    Swigger, Kathleen
    PROCEEDINGS OF THE 2008 IEEE INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION, 2008, : 11 - +
  • [34] Query Optimizing on a Decentralized Web Search Engine
    Wang, Daze
    Zhou, Ying
    Davis, Joseph
    APPLIED COMPUTING 2007, VOL 1 AND 2, 2007, : 878 - 879
  • [35] Ranking Entities Using Web Search Query Logs
    Billerbeck, Bodo
    Demartini, Gianluca
    Firan, Claudiu S.
    Iofciu, Teresa
    Krestel, Ralf
    RESEARCH AND ADVANCED TECHNOLOGY FOR DIGITAL LIBRARIES, 2010, 6273 : 273 - +
  • [36] Query Term Ranking based on Search Results Overlap
    Song, Wei
    Zhang, Yu
    Xie, Yubin
    Liu, Ting
    Li, Sheng
    PROCEEDINGS OF THE 34TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR'11), 2011, : 1253 - 1254
  • [37] Query Recommendation Considering Search Performance of Related Queries
    Xue, Yufei
    Liu, Yiqun
    Zhu, Tong
    Zhang, Min
    Ma, Shaoping
    Ru, Liyun
    INFORMATION RETRIEVAL TECHNOLOGY, 2010, 6458 : 410 - 419
  • [38] Efficient Approximate Thompson Sampling for Search Query Recommendation
    Hsieh, Chu-Cheng
    Neufeld, James
    King, Tracy
    Cho, Junghoo
    30TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, VOLS I AND II, 2015, : 740 - 746
  • [39] Improving Web search through collaborative query recommendation
    Balfe, E
    Smyth, B
    ECAI 2004: 16TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 110 : 268 - 272
  • [40] Time dependent approach for query and url recommendations using search engine query logs
    Umagandhi, R. (umakongunadu@gmail.com), 1600, International Association of Engineers (40):