Location-aware query reformulation for search engines

被引:1
作者
Huang, Zhipeng [1 ]
Qian, Yuqiu [1 ]
Mamoulis, Nikos [2 ]
机构
[1] Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Univ Ioannina, Ioannina, Greece
基金
欧盟地平线“2020”;
关键词
Query reformulation; Query recommendation; Query auto-completion; Spatial proximity; Spatial database; ALGORITHM;
D O I
10.1007/s10707-018-0334-5
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Query reformulation, including query recommendation and query auto-completion, is a popular add-on feature of search engines, which provide related and helpful reformulations of a keyword query. Due to the dropping prices of smartphones and the increasing coverage and bandwidth of mobile networks, a large percentage of search engine queries are issued from mobile devices. This makes it possible to improve the quality of query recommendation and auto-completion by considering the physical locations of the query issuers. However, limited research has been done on location-aware query reformulation for search engines. In this paper, we propose an effective spatial proximity measure between a query issuer and a query with a location distribution obtained from its clicked URLs in the query history. Based on this, we extend popular query recommendation and auto-completion approaches to our location-aware setting, which suggest query reformulations that are semantically relevant to the original query and give results that are spatially close to the query issuer. In addition, we extend the bookmark coloring algorithm for graph proximity search to support our proposed query recommendation approaches online, and we adapt an A* search algorithm to support our query auto-completion approach. We also propose a spatial partitioning based approximation that accelerates the computation of our proposed spatial proximity. We conduct experiments using a real query log, which show that our proposed approaches significantly outperform previous work in terms of quality, and they can be efficiently applied online.
引用
收藏
页码:869 / 893
页数:25
相关论文
共 32 条
  • [1] [Anonymous], 2008, P KDD
  • [2] [Anonymous], 2002, Proceedings of the 11th international conference on World Wide Web, DOI [10.1145/511446.511513, DOI 10.1145/511446.511513]
  • [3] [Anonymous], 2013, 22 INT WORLD WIDE WE
  • [4] [Anonymous], 2011, P 20 INT C WORLD WID, DOI DOI 10.1145/1963405.1963424
  • [5] [Anonymous], 2008, CIKM
  • [6] Baeza-Yates R. A., 2007, KDD
  • [7] Baeza-Yates RA, 2004, CURRENT TRENDS DATAB
  • [8] Bookmark-Coloring Algorithm for Personalized PageRank Computing
    Berkhin, Pavel
    [J]. INTERNET MATHEMATICS, 2006, 3 (01) : 41 - 62
  • [9] Bonchi F, 2012, SIGIR 2012: PROCEEDINGS OF THE 35TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, P345, DOI 10.1145/2348283.2348332
  • [10] Cadegnani Sara, 2017, Transactions on Computational Intelligence XXVI. LNCS 10190, P26, DOI 10.1007/978-3-319-59268-8_2