路网中的组最近紧凑POI集查询

Sen Zhao, Li Xiong
{"title":"路网中的组最近紧凑POI集查询","authors":"Sen Zhao, Li Xiong","doi":"10.1109/MDM.2019.00-68","DOIUrl":null,"url":null,"abstract":"Identifying a set of points of interest (POIs) is an important problem that finds applications in Location-Based Services (LBS). In this paper, we study a new spatial keyword query motivated by the scenario where a group of users staying at different places wishes to find a compact set of POIs (such as a restaurant and two museums) that is close to all users. We define the problem of group nearest compact POI set (GNCS) query in road networks and show that this problem is NP-hard. To solve the problem, we design query processing algorithms including a first feasible result search algorithm based on the perspective of each individual user, and an exact algorithm with optimizations based on the heuristic of first minimizing the aggregate distance between the POI set and the user group. Extensive performance studies using two real datasets confirm the efficiency and accuracy of our proposed algorithms.","PeriodicalId":241426,"journal":{"name":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Group Nearest Compact POI Set Queries in Road Networks\",\"authors\":\"Sen Zhao, Li Xiong\",\"doi\":\"10.1109/MDM.2019.00-68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Identifying a set of points of interest (POIs) is an important problem that finds applications in Location-Based Services (LBS). In this paper, we study a new spatial keyword query motivated by the scenario where a group of users staying at different places wishes to find a compact set of POIs (such as a restaurant and two museums) that is close to all users. We define the problem of group nearest compact POI set (GNCS) query in road networks and show that this problem is NP-hard. To solve the problem, we design query processing algorithms including a first feasible result search algorithm based on the perspective of each individual user, and an exact algorithm with optimizations based on the heuristic of first minimizing the aggregate distance between the POI set and the user group. Extensive performance studies using two real datasets confirm the efficiency and accuracy of our proposed algorithms.\",\"PeriodicalId\":241426,\"journal\":{\"name\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 20th IEEE International Conference on Mobile Data Management (MDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MDM.2019.00-68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th IEEE International Conference on Mobile Data Management (MDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MDM.2019.00-68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

识别一组兴趣点(poi)是在基于位置的服务(LBS)中寻找应用程序的一个重要问题。在本文中,我们研究了一个新的空间关键字查询,该查询的动机是一组待在不同地方的用户希望找到一组靠近所有用户的紧凑的poi(如餐馆和两个博物馆)。定义了路网中的群最近紧POI集(GNCS)查询问题,并证明了该问题是np困难的。为了解决这个问题,我们设计了一种查询处理算法,包括基于单个用户视角的第一可行结果搜索算法和基于首先最小化POI集与用户组之间的总距离的启发式优化的精确算法。使用两个真实数据集进行的广泛性能研究证实了我们提出的算法的效率和准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Group Nearest Compact POI Set Queries in Road Networks
Identifying a set of points of interest (POIs) is an important problem that finds applications in Location-Based Services (LBS). In this paper, we study a new spatial keyword query motivated by the scenario where a group of users staying at different places wishes to find a compact set of POIs (such as a restaurant and two museums) that is close to all users. We define the problem of group nearest compact POI set (GNCS) query in road networks and show that this problem is NP-hard. To solve the problem, we design query processing algorithms including a first feasible result search algorithm based on the perspective of each individual user, and an exact algorithm with optimizations based on the heuristic of first minimizing the aggregate distance between the POI set and the user group. Extensive performance studies using two real datasets confirm the efficiency and accuracy of our proposed algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信