Algorithms for Trajectory Points Clustering in Location-based Social Networks

Author:

Han Nan1,Qiao Shaojie1,Yue Kun2,Huang Jianbin3,He Qiang4,Tang Tingting1,Huang Faliang5,He Chunlin6,Yuan Chang-An7

Affiliation:

1. Chengdu University of Information Technology, Chendu, Sichuan, China

2. Yunnan University, Kunming, Yunnan, China

3. Xidian University, Xi’an, Shanxi, China

4. Swinburne University of Technology Melbourne, Melbourne, Australia

5. Nanning Normal University Nanning, Nanning, China

6. China West Normal University Nanchong, Nanchong, China

7. Guangxi College of Education Nanning, Nanning, China

Abstract

Recent advances in localization techniques have fundamentally enhanced social networking services, allowing users to share their locations and location-related contents. This has further increased the popularity of location-based social networks (LBSNs) and produces a huge amount of trajectories composed of continuous and complex spatio-temporal points from people’s daily lives. How to accurately aggregate large-scale trajectories is an important and challenging task. Conventional clustering algorithms (e.g., k -means or k -mediods) cannot be directly employed to process trajectory data due to their serialization, triviality and redundancy. Aiming to overcome the drawbacks of traditional k -means algorithm and k -mediods, including their sensitivity to the selection of the initial k value, the cluster centers and easy convergence to a locally optimal solution, we first propose an optimized k -means algorithm (namely OKM ) to obtain k optimal initial clustering centers based on the density of trajectory points. Second, because k -means is sensitive to noisy points, we propose an improved k -mediods algorithm called IKMD based on an acceptable radius r by considering users’ geographic location in LBSNs. The value of k can be calculated based on r , and the optimal k points are selected as the initial clustering centers with high densities to reduce the cost of distance calculation. Thirdly, we thoroughly analyze the advantages of IKMD by comparing it with the commonly used clustering approaches through illustrative examples. Last, we conduct extensive experiments to evaluate the performance of IKMD against seven clustering approaches including the proposed optimized k -means algorithm, k -mediods algorithm, traditional density-based k -mediods algorithm and the state-of-the-arts trajectory clustering methods. The results demonstrate that IKMD significantly outperforms existing algorithms in the cost of distance calculation and the convergence speed. The methods proposed is proved to contribute to a larger effort targeted at advancing the study of intelligent trajectory data analytics.

Funder

National Natural Science Foundation of China

Sichuan Science and Technology Program

Chengdu Technology Innovation and Research and Development Project

Chengdu Major Science and Technology Innovation Project

Chengdu ”Take the lead” Science and Technology Project

Digital Media Art, Key Laboratory of Sichuan Province, Sichuan Conservatory of Music, Chengdu, China

Guangdong Basic and Applied Basic Research Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Theoretical Computer Science

Reference42 articles.

1. David Arthur and Sergei Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’07), Nikhil Bansal, Kirk Pruhs, and Clifford Stein (Eds.). SIAM, 1027–1035.

2. An efficient incremental clustering based improved K-Medoids for IoT multivariate data cluster analysis

3. Habit2vec: Trajectory Semantic Embedding for Living Pattern Recognition in Population

4. Martin Ester, Hans-Peter Kriegel, Jörg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD’96). AAAI Press, 226–231.

5. Knowledge acquisition via incremental conceptual clustering

Cited by 7 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A three-in-one dynamic shared bicycle demand forecasting model under non-classical conditions;Applied Intelligence;2024-07-01

2. Co-occurrence Order-preserving Pattern Mining with Keypoint Alignment for Time Series;ACM Transactions on Management Information Systems;2024-06-12

3. PathletRL: Trajectory Pathlet Dictionary Construction using Reinforcement Learning;Proceedings of the 31st ACM International Conference on Advances in Geographic Information Systems;2023-11-13

4. Point2Hex: Higher-order Mobility Flow Data and Resources;Proceedings of the 31st ACM International Conference on Advances in Geographic Information Systems;2023-11-13

5. Optimal Risk-aware POI Recommendations during Epidemics;Proceedings of the 4th ACM SIGSPATIAL International Workshop on Spatial Computing for Epidemiology;2023-11-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3