Low-Complexity Detection of POI Boundaries Using Geo-Tagged Tweets: A Geographic Proximity Based Approach

Dung D. Vu, Won-Yong Shin
{"title":"Low-Complexity Detection of POI Boundaries Using Geo-Tagged Tweets: A Geographic Proximity Based Approach","authors":"Dung D. Vu, Won-Yong Shin","doi":"10.1145/2830657.2830663","DOIUrl":null,"url":null,"abstract":"Users tend to check in and post their statuses in location-based social networks (LBSNs) to describe that their interests are related to a point-of-interest (POI). Since the relevance of the data to the POI varies according to the geographic distance between the POI and the locations where the data are generated, it is important to characterize an area-of-interest (AOI) that enables to utilize the location information in a variety of businesses, services, and place advertisements. While previous studies on discovering AOIs were conducted based mostly on density-based clustering methods with the collection of geo-tagged photos from LBSNs, we focus on detecting a POI boundary, which corresponds to only one cluster containing its POI center. Using geo-tagged tweets recorded from Twitter users, this paper introduces a low-complexity two-phase strategy to detect a POI boundary by finding a suitable radius reachable from the POI center. We detect a polygon-type boundary of the POI as the convex hull (i.e., the outermost region) of selected geo-tags through our two-phase approach, where each phase proceeds on with different sizes of radius increment, thus yielding a more precise boundary. It is shown that our approach outperforms the conventional density-based clustering method in terms of runtime complexity.","PeriodicalId":198109,"journal":{"name":"Proceedings of the 8th ACM SIGSPATIAL International Workshop on Location-Based Social Networks","volume":"9 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 8th ACM SIGSPATIAL International Workshop on Location-Based Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2830657.2830663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Users tend to check in and post their statuses in location-based social networks (LBSNs) to describe that their interests are related to a point-of-interest (POI). Since the relevance of the data to the POI varies according to the geographic distance between the POI and the locations where the data are generated, it is important to characterize an area-of-interest (AOI) that enables to utilize the location information in a variety of businesses, services, and place advertisements. While previous studies on discovering AOIs were conducted based mostly on density-based clustering methods with the collection of geo-tagged photos from LBSNs, we focus on detecting a POI boundary, which corresponds to only one cluster containing its POI center. Using geo-tagged tweets recorded from Twitter users, this paper introduces a low-complexity two-phase strategy to detect a POI boundary by finding a suitable radius reachable from the POI center. We detect a polygon-type boundary of the POI as the convex hull (i.e., the outermost region) of selected geo-tags through our two-phase approach, where each phase proceeds on with different sizes of radius increment, thus yielding a more precise boundary. It is shown that our approach outperforms the conventional density-based clustering method in terms of runtime complexity.
使用地理标记推文的POI边界低复杂度检测:一种基于地理邻近的方法
用户倾向于在基于位置的社交网络(LBSNs)上签到并发布他们的状态,以描述他们的兴趣与兴趣点(POI)相关。由于数据与POI的相关性根据POI和生成数据的位置之间的地理距离而变化,因此重要的是要描述兴趣区域(AOI)的特征,以便在各种业务、服务和地方广告中利用位置信息。以往的aoi发现研究主要是基于基于密度的聚类方法,通过收集LBSNs的地理标记照片进行的,而我们的重点是检测POI边界,该边界仅对应于包含其POI中心的一个聚类。利用Twitter用户记录的地理标记推文,介绍了一种低复杂度的两阶段策略,通过寻找从POI中心可到达的合适半径来检测POI边界。通过我们的两阶段方法,我们将POI的多边形类型边界检测为所选地理标记的凸壳(即最外层区域),其中每个阶段以不同大小的半径增量进行,从而产生更精确的边界。结果表明,我们的方法在运行时复杂度方面优于传统的基于密度的聚类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信