Clustering uncertain trajectories

Authors:
Nikos Pelekis;Ioannis Kopanakis;Evangelos E. Kotsifakos;Elias Frentzos;Yannis Theodoridis
Affiliations:
University of Piraeus, Department of Statistics and Insurance Science, Piraeus, Greece;Technological Educational Institute of Crete, Crete, Greece;University of Piraeus, Department of Informatics, Piraeus, Greece;University of Piraeus, Department of Informatics, Piraeus, Greece;University of Piraeus, Department of Informatics, Piraeus, Greece
Venue:
Knowledge and Information Systems
Year:
2011

Citing 0
Cited 7

Privacy-aware querying over sensitive trajectory data

Proceedings of the 20th ACM international conference on Information and knowledge management
On the Mitchell similarity measure and its application to pattern recognition

Pattern Recognition Letters
Mining probabilistically frequent sequential patterns in uncertain databases

Proceedings of the 15th International Conference on Extending Database Technology
Similarity in (spatial, temporal and) spatio-temporal datasets

Proceedings of the 15th International Conference on Extending Database Technology
Private-HERMES: a benchmark framework for privacy-preserving mobility data querying and mining methods

Proceedings of the 15th International Conference on Extending Database Technology
Semantic trajectories modeling and analysis

ACM Computing Surveys (CSUR)
TODMIS: mining communities from trajectories

Proceedings of the 22nd ACM international conference on Conference on information & knowledge management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Knowledge discovery in Trajectory Databases (TD) is an emerging field which has recently gained great interest. On the other hand, the inherent presence of uncertainty in TD (e.g., due to GPS errors) has not been taken yet into account during the mining process. In this paper, we study the effect of uncertainty in TD clustering and introduce a three-step approach to deal with it. First, we propose an intuitionistic point vector representation of trajectories that encompasses the underlying uncertainty and introduce an effective distance metric to cope with uncertainty. Second, we devise CenTra, a novel algorithm which tackles the problem of discovering the Centroid Trajectory of a group of movements taking into advantage the local similarity between portions of trajectories. Third, we propose a variant of the Fuzzy C-Means (FCM) clustering algorithm, which embodies CenTra at its update procedure. Finally, we relax the vector representation of the Centroid Trajectories by introducing an algorithm that post-processes them, as such providing these mobility patterns to the analyst with a more intuitive representation. The experimental evaluation over synthetic and real world TD demonstrates the efficiency and effectiveness of our approach.