Abstract: This paper study of clustering algorithm for trajectories elements which is based on dense of the grouping element. Our experiments give new method for partitioning the TRACLUS algorithm and provide the Euclidean distance of moving element. We provide a new approach of moving elements. This approach develops a cluster of trajectory object and calculates the actual distance of moving object. This algorithm works on the CLSTR algorithm and calculates the actual cell value. This paper assumes the entropy of moving object and heuristic parameter.

Keywords: Trajectory algorithm, Partition and group work, Data mining, Cluster, Trajectory clustering.