A New Trajectory Clustering Algorithm Based on TRACLUS

Most trajectory clustering algorithms including the famous TRACLUS require the setting of two input parameters and are sensitive to input parameters. Incorrect setting may cause the algorithm to produce the wrong clusters. Aiming at this vulnerability, we propose a Shielding Parameters Sensitivity Trajectory Clustering algorithm named SPSTC. Firstly, we present some definitions about the core distance and reachable distance of line segment, according to which generates cluster sorting. Secondly, reachable plots of line segment sets are constructed according to cluster sorting and reachable distance. Thirdly, parameterized sequence is extracted according to reachable plot, and then the final trajectory clustering based on parameterized sequence is acquired. Parameterized sequence represents inner clustering structure of trajectory data. The experimental results on real and synthetic trajectory data demonstrate that the SPSTC algorithm reduces the sensitivity to input parameters remarkably and improves the efficiency of trajectory clustering while keeps the quality of trajectory clustering.