Cover Image for System.Linq.Enumerable+EnumerablePartition`1[System.Char]

A Path-Clustering Driving Travel-Route Excavation

OAI: oai:igi-global.com:306750 DOI: 10.4018/IJSWIS.306750
Published by: IGI Global

Abstract

The refueling trajectory of self-driving tourists is sparse, and it is difficult to restore the real travel route. A sparse trajectory clustering algorithm is proposed based on semantic representation to mine popular self-driving travel routes. Different from the traditional trajectory clustering algorithm based on trajectory point matching, the semantic relationship between different trajectory points is researched in this algorithm, and the low-dimensional vector representation of the trajectory is learned. First, the neural network language model is used to learn the distributed vector representation of the fueling station; then, the average of all the station vectors in each trajectory is taken as the vector representation of the trajectory. Finally, the classic k-means algorithm is used to cluster the trajectory vectors. The final visualization results show that the proposed algorithm effectively mines two popular self-driving travel routes.