Co-Clustering Network-Constrained Trajectory Data
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 4 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Mining frequency-based sequential trajectory co-clusterscited by 0
- 2021Mining frequency-based sequential trajectory co-clusters27 Oct 2021