Graph-Based Approaches to Clustering Network-Constrained Trajectory Data - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Graph-Based Approaches to Clustering Network-Constrained Trajectory Data


Even though 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 two approaches to clustering network-constrained trajectory data. The first approach discovers clusters of trajectories that traveled along the same parts of the road network. The second approach is segment-oriented and aims to group together road segments based on trajectories that they have in common. Both approaches use a graph model to depict the interactions between observations w.r.t. their similarity and cluster this similarity graph using a community detection algorithm. We also present experimental results obtained on synthetic data to showcase our propositions.
Fichier principal
Vignette du fichier
ClusteringNetworkConstrainedTrajectoryData.pdf (2.59 Mo) Télécharger le fichier
NFMCP2012presentation.pdf (1.68 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Other

Dates and versions

hal-00737457 , version 1 (01-10-2012)



Mohamed Khalil El Mahrsi, Fabrice Rossi. Graph-Based Approaches to Clustering Network-Constrained Trajectory Data. Workshop on New Frontiers in Mining Complex Patterns (NFMCP 2012), held at ECML-PKDD 2012, Sep 2012, Bristol, United Kingdom. pp.184-195. ⟨hal-00737457⟩
306 View
316 Download



Gmail Facebook Twitter LinkedIn More