A Trajectory Data Clustering Method Based On Dynamic Grid Density

被引:0
作者
Li, Junhuai [1 ,2 ]
Yang, Mengmeng [1 ]
Liu, Na [1 ]
Wang, Zhixiao [1 ,2 ]
Yu, Lei [1 ,2 ]
机构
[1] Xian Univ Technol, Sch Comp Sci & Engn, Xian 710048, Peoples R China
[2] Shaanxi Key Lab Network Comp & Secur Technol, Xian 710048, Peoples R China
来源
INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING | 2015年 / 8卷 / 02期
关键词
Frequent trajectory; Clustering; Support; Density;
D O I
10.14257/ijgdc.2015.8.2.01
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Under the traditional method of frequent trajectory mining, the location of data is obtained through the GPS device. However, limited equipment accuracy may incur location ambiguity. In this paper, we propose a new trajectory data clustering method based on dynamic grid density, in order to remove this ambiguity. In this method, the trajectory space of an object is firstly divided into equal-sized squares dynamically Then the trajectories of object are mapped to their corresponding square. Next, the density of each grid is calculated and all the frequent squares are acquired given the minimum support threshold. Lastly, the frequent area is obtained by merging the frequent squares acquired previously, using the boundary function provided. The experimental results show that this method provides an optional way of finding the frequent movement sequence.
引用
收藏
页码:1 / 8
页数:8
相关论文
共 50 条
[31]   A new clustering method based on references, density and neural network [J].
Gou, Hong-Tu ;
Xu, Jian-Suo ;
Wang, Li .
PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, :1060-+
[32]   Space Breakdown Method A new approach for density -based clustering [J].
Ardelean, Eugen-Richard ;
Stanciu, Alexander ;
Dinsoreanu, Mihaela ;
Potolea, Rodica ;
Lemnaru, Camelia ;
Moca, Vasile Vlad .
2019 IEEE 15TH INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTER COMMUNICATION AND PROCESSING (ICCP 2019), 2019, :419-425
[33]   Grid density peak clustering algorithm based on Zipf distribution [J].
Ma F.-M. ;
Gong T. ;
Yang F. ;
Zhang T.-F. .
Kongzhi yu Juece/Control and Decision, 2024, 39 (02) :577-587
[34]   Combination of Density-Based Spatial Clustering With Grid Search Using Nash Equilibrium [J].
Kazemi, Uranus ;
Soleimani, Seyfollah .
ENGINEERING REPORTS, 2025, 7 (03)
[35]   A dynamic trust based clustering method for secure data gathering in Internet of Things [J].
Naghibi, Maryam ;
Barati, Hamid ;
Barati, Ali .
COMPUTING, 2025, 107 (04)
[36]   Subspace clustering over high-dimensional data stream based on grid density and attribute relativity [J].
Huang, Guoyan ;
Miao, Liyun ;
Ren, Jiadong .
Advances in Information Sciences and Service Sciences, 2012, 4 (17) :91-99
[37]   A Dynamic Clustering Querying Algorithm Based on Grid in Manufacturing System [J].
Zeng Jun .
INNOVATION MANUFACTURING AND ENGINEERING MANAGEMENT, 2011, 323 :89-93
[38]   Research on application of grid-based and density-based clustering algorithm [J].
Shen, LX ;
Yan, C .
PROCEEDINGS OF 2003 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING, VOLS I AND II, 2003, :684-689
[39]   An algorithm based on density and compactness for dynamic overlapping clustering [J].
Perez-Suarez, Airel ;
Fco Martinez-Trinidad, Jose ;
Carrasco-Ochoa, Jesus A. ;
Medina-Pagola, Jose E. .
PATTERN RECOGNITION, 2013, 46 (11) :3040-3055
[40]   Proposal for a Pivot-Based Vehicle Trajectory Clustering Method [J].
Reyes, Gary ;
Lanzarini, Laura ;
Hasperue, Waldo ;
Bariviera, Aurelio F. .
TRANSPORTATION RESEARCH RECORD, 2022, 2676 (04) :281-295