Top-k Collective Spatial Keyword Approximate Query

被引:1
|
作者
Meng, Xiangfu [1 ]
Zhang, Zilun [1 ]
Cui, Shuolin [2 ]
Huo, Hongjin [1 ]
机构
[1] Liaoning Tech Univ, Sch Elect & Informat Engn, Huludao, Peoples R China
[2] Univ Glasgow, Glasgow Int Coll, Glasgow, Lanark, Scotland
来源
WEB INFORMATION SYSTEMS AND APPLICATIONS, WISA 2024 | 2024年 / 14883卷
关键词
Spatial keyword query; Semantic similarity; Road network; VP-Tree; EFFICIENT; SEARCH;
D O I
10.1007/978-981-97-7707-5_20
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The rapid expansion of spatial textual data, covering location and textual information, has spurred extensive research and application of spatial keyword query technology. Traditional methods focus on identifying groups of spatial objects that satisfy spatial keyword queries but often overlook the relationships between these objects, such as social correlations. To address this problem, this paper proposes a top-k collective spatial keyword approximate query approach. Firstly, an association rule-based social relationship evaluation method for spatial objects is proposed. Then, we design a scoring function that combines the location distances and social relationships of spatial objects within a group. Secondly, a Vantage Point Tree (VP-Tree) based pruning strategy is proposed for quickly searching the local neighborhood of spatial objects. Finally, the top-k spatial object groups are selected as the query result by leveraging the scoring function to calculate the score of candidate object groups. The experimental results demonstrate that the proposed social relationship evaluation method can achieve high accuracy, the proposed pruning strategy has high execution efficiency, and the obtained top-k groups of spatial objects can further meet users' needs and preferences well.
引用
收藏
页码:227 / 238
页数:12
相关论文
共 50 条
  • [41] RASIM: a rank-aware separate index method for answering top-k spatial keyword queries
    Hyuk-Yoon Kwon
    Kyu-Young Whang
    Il-Yeol Song
    Haixun Wang
    World Wide Web, 2013, 16 : 111 - 139
  • [42] Constrained top-k nearest fuzzy keyword queries on encrypted graph in road network
    Sun, Fangyuan
    Yu, Jia
    Ge, Xinrui
    Yang, Ming
    Kong, Fanyu
    COMPUTERS & SECURITY, 2021, 111
  • [43] Distributed top-k similarity query on big trajectory streams
    Zhang, Zhigang
    Qi, Xiaodong
    Wang, Yilin
    Jin, Cheqing
    Mao, Jiali
    Zhou, Aoying
    FRONTIERS OF COMPUTER SCIENCE, 2019, 13 (03) : 647 - 664
  • [44] Diversifying Top-k Routes with Spatial Constraints
    Xu, Hong-Fei
    Gu, Yu
    Qi, Jian-Zhong
    He, Jia-Yuan
    Yu, Ge
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2019, 34 (04) : 818 - 838
  • [45] Fast Inbound Top-K Query for Random Walk with Restart
    Zhang, Chao
    Jiang, Shan
    Chen, Yucheng
    Sun, Yidan
    Han, Jiawei
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, ECML PKDD 2015, PT II, 2015, 9285 : 608 - 624
  • [46] G-Index Model: A generic model of index schemes for top-k spatial-keyword queries
    Hyuk-Yoon Kwon
    Haixun Wang
    Kyu-Young Whang
    World Wide Web, 2015, 18 : 969 - 995
  • [47] Improvement of Top-k query algorithm for moving objects in road networks
    Wang, Zhen
    PROCEEDINGS OF THE 2016 3RD INTERNATIONAL CONFERENCE ON MECHATRONICS AND INFORMATION TECHNOLOGY (ICMIT), 2016, 49 : 344 - 347
  • [48] Top-k query processing over uncertain data in distributed environments
    Sun, Yongjiao
    Yuan, Ye
    Wang, Guoren
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2012, 15 (04): : 429 - 446
  • [49] Cost-Aware and Distance-Constrained Collective Spatial Keyword Query
    Chan, Harry Kai-Ho
    Liu, Shengxin
    Long, Cheng
    Wong, Raymond Chi-Wing
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (02) : 1324 - 1336
  • [50] Time-Aware and Direction-Constrained Collective Spatial Keyword Query
    Feng, Zhe
    Li, Guohui
    Li, Jianjun
    Jin, Changlong
    Du, Xiaokun
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2025, 26 (03) : 3039 - 3055