A Density-Based Clustering of Spatio-Temporal Data

Moving objects are one of many topics that have large data sets generated rapidly and continuously by spatial technologies. This paper focuses on the data mining of an example of such large data sets, spatio-temporal data. This research aims to predict future motion of moving objects regarding their location and time of arrival. A spatio-temporal algorithm is developed and presented which clusters sub-trajectories into similar groups taking into consideration the time dimension; time-aware, using a density based clustering technique. The presented algorithm partitions trajectories into smaller sub-trajectories then groups these segments based on a density-based clustering technique. Three different experiments are carried out, each one with a different data set. The results of each experiment are analyzed and predictions are made for the motion of each data set.

[1]  Nikos Pelekis,et al.  Literature review of spatio-temporal database models , 2004, The Knowledge Engineering Review.

[2]  Stefano Spaccapietra,et al.  Semantic trajectories modeling and analysis , 2013, CSUR.

[3]  Nikos Pelekis,et al.  Clustering uncertain trajectories , 2011, Knowledge and Information Systems.

[4]  Valéria Cesário Times,et al.  DB-SMoT: A direction-based spatio-temporal clustering method , 2010, 2010 5th IEEE International Conference Intelligent Systems.

[5]  Dong Zhou,et al.  Translation techniques in cross-language information retrieval , 2012, CSUR.

[6]  Slava Kisilevich,et al.  Spatio-temporal clustering , 2010, Data Mining and Knowledge Discovery Handbook.

[7]  Jae-Gil Lee,et al.  Trajectory clustering: a partition-and-group framework , 2007, SIGMOD '07.

[8]  Nikos Pelekis,et al.  Visually exploring movement data via similarity-based analysis , 2012, Journal of Intelligent Information Systems.