PARALLEL SPATIOTEMPORAL SPECTRAL CLUSTERING WITH MASSIVE TRAJECTORY DATA
- 1School of Remote Sensing and Information Engineering, Wuhan University, China
- 2Collaborative Innovation Center of Geospatial Technology, Wuhan University, Wuhan, China
- 3Nanjing University of Posts and Telecommunications, China
Keywords: Spectral Clustering, Trajectory data, Spatiotemporal Clustering, DTW, Multi-Thread, Urban Computing
Abstract. Massive trajectory data contains wealth useful information and knowledge. Spectral clustering, which has been shown to be effective in finding clusters, becomes an important clustering approaches in the trajectory data mining. However, the traditional spectral clustering lacks the temporal expansion on the algorithm and limited in its applicability to large-scale problems due to its high computational complexity. This paper presents a parallel spatiotemporal spectral clustering based on multiple acceleration solutions to make the algorithm more effective and efficient, the performance is proved due to the experiment carried out on the massive taxi trajectory dataset in Wuhan city, China.