Trajectory dimensionality reduction and hyperparameter settings of DBSCAN for trajectory clustering

Abstract

The density-based spatial clustering of application with noise (DBSCAN) algorithm has good robustness and is widely employed to cluster vehicle trajectories for vehicle movement pattern recognition. However, the distance or similarity between two trajectories varies from tens to hundreds of thousands, and there is no effective method for determining the values of the hyperparameters eps and MinPts of DBSCAN. In addition, with increasing sizes of trajectory datasets, some trajectory clustering methods that directly analyse points and line segments incur large computational costs and time overhead. To solve these two dilemmas, the authors propose an effective trajectory dimensionality reduction method and a DBSCAN hyperparameter initial value setting method. The trajectory dimensionality reduction algorithm processes trajectories with different lengths into the same dimensionality (the same number of feature points). The reserved points preserve the spatial and temporal information of these trajectories as much as possible. The DBSCAN hyperparameter initial value setting algorithm obtains the effective initial values of eps and MinPts for facilitating subsequent adjustments. Finally, we validate these proposed methods on two trajectory datasets collected from two real-world scenes, and the experimental results are promising and effective.

Hierarchical Clustering Algorithm for Multi-Camera Vehicle Trajectories Based on Spatio-Temporal Grouping under Intelligent Transportation and Smart City

“…The silhouette coefficient [ 56 ] is used to compare and analyze the traditional DBSCAN-based method [ 57 ] with the proposed algorithm to verify the effectiveness of the proposed method. The average distance between the sample and other samples in the same cluster and the average distance between the sample and the next nearest cluster are combined for evaluation: …”

Influence of Different Data Interpolation Methods for Sparse Data on the Construction Accuracy of Electric Bus Driving Cycle

“…At present, the main data classification algorithms include K-means, GMM (Gaussian mixture model) [25], mean-shift clustering, K-medians and density-based spatial clustering of applications with noise (DBSCAN) [26]. The data sample studied in this paper is based on a large number of undeveloped driving data stored in the new energy bus platform of Nantong city.…”

Hyper-Spectral Image Pixel Classification Based on Golden Sine and Chaotic Spotted Hyena Optimization Algorithm

“…The DBSCAN hyperparameter initialization algorithm obtains the effective initial values of eps and MinPts, which is convenient for subsequent adjustment. Finally, they verify these methods on two real scene trajectory data sets, and the experimental results are satisfactory and effective [14]. In order to efficiently cluster and reduce dimension of data, T. Guo et al proposed a prior dependence graph (PDG) construction method to model and discover complex relationships of data.…”