Application of Three-Dimensional Hierarchical Density-Based Spatial Clustering of Applications with Noise in Ship Automatic Identification System Trajectory-Cluster Analysis

Clustering algorithms are widely used in statistical data analysis as a form of unsupervised machine learning, playing a crucial role in big data mining research for Maritime Intelligent Transportation Systems. While numerous studies have explored methods for optimizing ship trajectory clustering, such as narrowing dynamic time windows to prevent errors in time warp calculations or employing the Mahalanobis distance, these methods enhance DBSCAN (Density-Based Spatial Clustering of Applications with Noise) by leveraging trajectory similarity features for clustering. In recent years, machine learning research has rapidly accumulated, and multiple studies have shown that HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) outperforms DBSCAN in achieving accurate and efficient clustering results due to its hierarchical density-based clustering processing technique, particularly in big data mining. This study focuses on the area near Taichung Port in central Taiwan, a crucial maritime shipping route where ship trajectories naturally exhibit a complex and intertwined distribution. Using ship coordinates and heading, the experiment normalized and transformed them into three-dimensional spatial features, employing the HDBSCAN algorithm to obtain optimal clustering results. These results provided a more nuanced analysis compared to human visual observation. This study also utilized O notation and execution time to represent the performance of various methods, with the literature review indicating that HDBSCAN has the same time complexity as DBSCAN but outperforms K-means and other methods. This research involved approximately 293,000 real historical data points and further employed the Silhouette Coefficient and Davies–Bouldin Index to objectively analyze the clustering results. The experiment generated eight clusters with a noise ratio of 12.7%, and the evaluation results consistently demonstrate that HDBSCAN outperforms other methods for big data analysis of ship trajectory clustering.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2025-02-28
DOI
https://doi.org/10.3390/app15052621
Citations
5
Primary Topic
Maritime Navigation and Safety
Type
article
Field-Weighted Citation Impact
5.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Application of Three-Dimensional Hierarchical Density-Based Spatial Clustering of Applications with Noise in Ship Automatic Identification System Trajectory-Cluster Analysis

Te‐Jen Su, Mengyuan Tian, Shih-Ming Wang, Wei-Hong Lin et al.
5 citations
Applied Sciences
Maritime Navigation and Safety
5.73
article

Application of Three-Dimensional Hierarchical Density-Based Spatial Clustering of Applications with Noise in Ship Automatic Identification System Trajectory-Cluster Analysis

Te‐Jen Su, Mengyuan Tian, Shih-Ming Wang, Wei-Hong Lin, Qian-Yi Zhuang, Jui-Chuan Cheng, Wenbo Yang
article en
5 citations

Abstract

Clustering algorithms are widely used in statistical data analysis as a form of unsupervised machine learning, playing a crucial role in big data mining research for Maritime Intelligent Transportation Systems. While numerous studies have explored methods for optimizing ship trajectory clustering, such as narrowing dynamic time windows to prevent errors in time warp calculations or employing the Mahalanobis distance, these methods enhance DBSCAN (Density-Based Spatial Clustering of Applications with Noise) by leveraging trajectory similarity features for clustering. In recent years, machine learning research has rapidly accumulated, and multiple studies have shown that HDBSCAN (Hierarchical Density-Based Spatial Clustering of Applications with Noise) outperforms DBSCAN in achieving accurate and efficient clustering results due to its hierarchical density-based clustering processing technique, particularly in big data mining. This study focuses on the area near Taichung Port in central Taiwan, a crucial maritime shipping route where ship trajectories naturally exhibit a complex and intertwined distribution. Using ship coordinates and heading, the experiment normalized and transformed them into three-dimensional spatial features, employing the HDBSCAN algorithm to obtain optimal clustering results. These results provided a more nuanced analysis compared to human visual observation. This study also utilized O notation and execution time to represent the performance of various methods, with the literature review indicating that HDBSCAN has the same time complexity as DBSCAN but outperforms K-means and other methods. This research involved approximately 293,000 real historical data points and further employed the Silhouette Coefficient and Davies–Bouldin Index to objectively analyze the clustering results. The experiment generated eight clusters with a noise ratio of 12.7%, and the evaluation results consistently demonstrate that HDBSCAN outperforms other methods for big data analysis of ship trajectory clustering.

Applied SciencesVol. 15(5)
National Kaohsiung University of Science and Technology (TW), Cheng Shiu University (TW)
Life below water
Openalex Percentile: Top 5%
Maritime Navigation and Safety
5.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.