Skip to Main content Skip to Navigation
Book sections

Graph-Based Approaches to Clustering Network-Constrained Trajectory Data

Abstract : Clustering trajectory data attracted considerable attention in the last few years. Most of prior work assumed that moving objects can move freely in an euclidean space and did not consider the eventual presence of an underlying road network and its influence on evaluating the similarity between trajectories. In this paper, we present an approach to clustering such network-constrained trajectory data. More precisely we aim at discovering groups of road segments that are often travelled by the same trajectories. To achieve this end, we model the interactions between segments w.r.t. their similarity as a weighted graph to which we apply a community detection algorithm to discover meaningful clusters. We showcase our proposition through experimental results obtained on synthetic datasets.
Document type :
Book sections
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00874886
Contributor : Fabrice Rossi <>
Submitted on : Friday, October 18, 2013 - 5:58:23 PM
Last modification on : Friday, July 31, 2020 - 10:44:07 AM
Long-term archiving on: : Friday, April 7, 2017 - 1:24:54 PM

Files

nfmcp2012extended.pdf
Files produced by the author(s)

Identifiers

Citation

Mohamed Khalil El Mahrsi, Fabrice Rossi. Graph-Based Approaches to Clustering Network-Constrained Trajectory Data. Appice, Annalisa and Ceci, Michelangelo and Loglisci, Corrado and Manco, Giuseppe and Masciari, Elio and Ras, Zbigniew. New Frontiers in Mining Complex Patterns, Springer Berlin Heidelberg, pp.124-137, 2013, Lecture Notes in Computer Science, 978-3-642-37381-7. ⟨10.1007/978-3-642-37382-4_9⟩. ⟨hal-00874886⟩

Share

Metrics

Record views

503

Files downloads

901