Co-Clustering Network-Constrained Trajectory Data - Archive ouverte HAL Access content directly
Book Sections Year : 2015

Co-Clustering Network-Constrained Trajectory Data


Recently, clustering moving object trajectories kept gaining interest from both the data mining and machine learning communities. This problem, however, was studied mainly and extensively in the setting where moving objects can move freely on the euclidean space. In this paper, we study the problem of clustering trajectories of vehicles whose movement is restricted by the underlying road network. We model relations between these trajectories and road segments as a bipartite graph and we try to cluster its vertices. We demonstrate our approaches on synthetic data and show how it could be useful in inferring knowledge about the flow dynamics and the behavior of the drivers using the road network.
Fichier principal
Vignette du fichier
elmahrsiguigouresetal2015coclustering.pdf (1020.83 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01222649 , version 1 (30-10-2015)


Attribution - ShareAlike



Mohamed Khalil El Mahrsi, Romain Guigourès, Fabrice Rossi, Marc Boullé. Co-Clustering Network-Constrained Trajectory Data. Fabrice Guillet; Bruno Pinaud; Gilles Venturini; Djamel Abdelkader Zighed. Advances in Knowledge Discovery and Management, 615, Springer International Publishing, pp.19-32, 2015, Studies in Computational Intelligence, 978-3-319-23750-3. ⟨10.1007/978-3-319-23751-0_2⟩. ⟨hal-01222649⟩
301 View
121 Download



Gmail Facebook Twitter LinkedIn More