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.
Trajectory dimensionality reduction and hyperparameter settings of DBSCAN for trajectory clustering
2022
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Trajectory dimensionality reduction and hyperparameter settings of DBSCAN for trajectory clustering
Wiley | 2022
|Research on Ship Trajectory Extraction Based on Multi-Attribute DBSCAN Optimisation Algorithm
Online Contents | 2021
|Research on Ship Trajectory Extraction Based on Multi-Attribute DBSCAN Optimisation Algorithm
DOAJ | 2021
|