Location Aware Keyword Query Suggestion Based on Document Proximity

被引:12
作者
Qi, Shuyao [1 ]
Wu, Dingming [1 ,3 ]
Mamoulis, Nikos [2 ]
机构
[1] Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Univ Ioannina, Dept Comp Sci & Engn, GR-45110 Ioannina, Greece
[3] Shenzhen Univ, Coll Comp Sci & Software Engn, Shenzhen, Peoples R China
基金
欧盟地平线“2020”;
关键词
Query suggestion; spatial databases; RANDOM-WALK; SEARCH;
D O I
10.1109/TKDE.2015.2465391
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Keyword suggestion in web search helps users to access relevant information without having to know how to precisely express their queries. Existing keyword suggestion techniques do not consider the locations of the users and the query results; i.e., the spatial proximity of a user to the retrieved results is not taken as a factor in the recommendation. However, the relevance of search results in many applications (e.g., location-based services) is known to be correlated with their spatial proximity to the query issuer. In this paper, we design a location-aware keyword query suggestion framework. We propose a weighted keyword-document graph, which captures both the semantic relevance between keyword queries and the spatial distance between the resulting documents and the user location. The graph is browsed in a random-walk-with-restart fashion, to select the keyword queries with the highest scores as suggestions. To make our framework scalable, we propose a partition-based approach that outperforms the baseline algorithm by up to an order of magnitude. The appropriateness of our framework and the performance of the algorithms are evaluated using real data.
引用
收藏
页码:82 / 97
页数:16
相关论文
共 51 条
[1]  
Anagnostopoulos Aris., 2010, Proceedings of the Third International Conference on Web Search and Web Data Mining, WSDM 2010, New York, NY, USA, February 4-6, 2010, P161
[2]  
[Anonymous], 2008, P 17 ACM C INF KNOWL
[3]  
[Anonymous], 2012, CIKM
[4]  
[Anonymous], 2008, CIKM
[5]  
Avrachenkov K, 2011, LECT NOTES COMPUT SC, V6732, P50
[6]  
Baeza-Yates R, 2007, KDD-2007 PROCEEDINGS OF THE THIRTEENTH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P76
[7]  
BaezaYates R, 2004, LECT NOTES COMPUT SC, V3268, P588
[8]  
Bahmani B, 2010, PROC VLDB ENDOW, V4, P173
[9]  
Beeferman D., 2000, Proceedings. KDD-2000. Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, P407, DOI 10.1145/347090.347176
[10]   Bookmark-Coloring Algorithm for Personalized PageRank Computing [J].
Berkhin, Pavel .
INTERNET MATHEMATICS, 2006, 3 (01) :41-62