Clustering Algorithms for Spatial Data Mining

Chetashri Bhadane, K. Shah
{"title":"Clustering Algorithms for Spatial Data Mining","authors":"Chetashri Bhadane, K. Shah","doi":"10.1145/3397056.3397068","DOIUrl":null,"url":null,"abstract":"With the advances in mobile and wireless technologies, there has been a rise in applications that track and share the users' geospatial data. People use several social networking sites such as Twitter, Facebook and Flickr, where they share their status updates. With the integration of Global Positioning System (GPS) with mobile phones, it is now possible to share one's locations on these social networks. GPS allows us to record and track a person's movement along with the timestamp. The data set obtained from these GPS logs is vast and is widely used to analyze the users' movement patterns. Specifically, we can find out significant locations based on the number of users present at that location and the time spent by them at such places. Once significant places have been identified, it is also possible to identify the semantic importance of these locations. This paper presents an overview of the clustering techniques used to find important places of interest using large GPS based mobility datasets. Four clustering algorithms, K-Means, DBSCAN, OPTICS and Hierarchical, are implemented, and performance is tested using real-time data of 50 users collected over 2--5 years. Performance summary depicts that K-Means and DBSCAN perform well for spatial data.","PeriodicalId":365314,"journal":{"name":"Proceedings of the 2020 3rd International Conference on Geoinformatics and Data Analysis","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2020 3rd International Conference on Geoinformatics and Data Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3397056.3397068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

With the advances in mobile and wireless technologies, there has been a rise in applications that track and share the users' geospatial data. People use several social networking sites such as Twitter, Facebook and Flickr, where they share their status updates. With the integration of Global Positioning System (GPS) with mobile phones, it is now possible to share one's locations on these social networks. GPS allows us to record and track a person's movement along with the timestamp. The data set obtained from these GPS logs is vast and is widely used to analyze the users' movement patterns. Specifically, we can find out significant locations based on the number of users present at that location and the time spent by them at such places. Once significant places have been identified, it is also possible to identify the semantic importance of these locations. This paper presents an overview of the clustering techniques used to find important places of interest using large GPS based mobility datasets. Four clustering algorithms, K-Means, DBSCAN, OPTICS and Hierarchical, are implemented, and performance is tested using real-time data of 50 users collected over 2--5 years. Performance summary depicts that K-Means and DBSCAN perform well for spatial data.
空间数据挖掘的聚类算法
随着移动和无线技术的进步,跟踪和共享用户地理空间数据的应用越来越多。人们使用几个社交网站,如Twitter、Facebook和Flickr,在那里他们分享自己的状态更新。随着全球定位系统(GPS)与手机的整合,现在可以在这些社交网络上分享自己的位置。GPS可以让我们记录和追踪一个人的活动以及时间戳。从这些GPS日志中获得的数据集是巨大的,被广泛用于分析用户的运动模式。具体来说,我们可以根据该地点的用户数量和他们在这些地点花费的时间找到重要的地点。一旦确定了重要的地点,就有可能确定这些地点的语义重要性。本文概述了利用基于GPS的大型移动数据集寻找重要兴趣地点的聚类技术。实现了K-Means、DBSCAN、OPTICS和Hierarchical四种聚类算法,并使用超过2- 5年收集的50个用户的实时数据对性能进行了测试。性能总结描述了K-Means和DBSCAN在空间数据上表现良好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信