Development of HTC-DBSCAN: A Hierarchical Trajectory Clustering Algorithm with Automated Parameter Tuning
Source abstract
Abstract
Existing route-clustering methods often fail to identify abnormal sections or similarities between routes, mainly when working with large or long datasets. While sub-route clustering can detect regional patterns, it struggles to accurately capture the overall route structure. The present study proposes a new ship route-clustering method that enhances computational efficiency and noise recognition while addressing these limitations. We refined Automatic Identification System data via four data-cleaning processes and applied a statistical distance measurement to assess ship trajectory similarity. Dimensionality reduction was then used to facilitate clustering. The clustering of ship route similarities is non-parametric and can be applied to datasets not separated based on density to find clusters of various densities. Density-Based Spatial Clustering of Applications (DBSCA) applies to many research fields; using the DBSCA with Noise (DBSCAN) algorithm, we propose an improved DBSCAN algorithm that automatically determines the parameters Epsilon and MinPts. In this study, as a core ship route-clustering process, we propose a sub-route clustering process by setting the distance and density of data points to clear standards for re-analysis and completion. The proposed approach demonstrates markedly enhanced clustering performance, offering a more sophisticated and efficient basis for ship route decision-making.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Data Management and Algorithms · Traffic Prediction and Management Techniques
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Graduate School of Maritime Transportation System, Mokpo National Maritime University, Mokpo 58628, Republic of Korea
Division of Navigation Science, Mokpo National Maritime University, Mokpo 58628, Republic of Korea
Funding
Ministry of Oceans and Fisheries · Ministry of Education (MOE)
References (47)
Show source-provided references
1. IMO (2018). Regulatory Scoping Exercise for the Use of Maritime Autonomous Surface Ships (MASS), IMO. MSC.99/WP.9.
2. Incorporation of AIS data-based machine learning into unsupervised route planning for maritime autonomous surface ships10.1016/j.tre.2023.103171 ↗
3. Shalwani, M. (2021). Insights into the Topic of the Fourth Industrial Revolution. [Ph.D. Thesis, Khalifa University].
4. Design of information exchange handling system for safe navigation of autonomous ship
5. Lee, J.S. (2023). A Study on Integrated Framework for Maritime Traffic Network Based on Spatial Analysis Algorithms Using Big Data. [Ph.D. Thesis, National Korea Maritime and Ocean University].
6. Spatiotemporal pattern mining: Algorithms and applications
7. Porikli, F., and Haga, T. (July, January 27). Event detection by eigenvector decomposition using object and frame features. Proceedings of the Computer Society Conference on Computer Vision and Pattern Recognition Workshops, Washington, DC, USA.
8. Buzan, D., Sclaroff, S., and Kollios, G. (2004, January 26). Extraction and clustering of motion trajectories in video. Proceedings of the International Conference on Pattern Recognition, Cambridge, UK.
9. On-line trajectory clustering for anomalous events detection10.1016/j.patrec.2006.02.004 ↗
10. Clustering of vehicle trajectories10.1109/TITS.2010.2048101 ↗
11. Comparing and combining time series trajectories using dynamic time warping10.1016/j.procs.2016.08.106 ↗
12. Li, H.H., Liu, J.X., Liu, R.W., Xiong, N.X., Wu, K.F., and Kim, T.H. (2017). A dimensionality reduction-based multi-step clustering method for robust vessel trajectory analysis. Sensors, 17.10.3390/s17081792 ↗
13. Cao, J., Liang, M., Li, Y., Chen, J., Li, H., Liu, R.W., and Liu, J. (2018, January 9–12). PCA-based hierarchical clustering of AIS trajectories with automatic extraction of clusters. Proceedings of the 3rd International Conference on Big Data Analysis, Shanghai, China.10.1109/ICBDA.2018.8367725 ↗
14. An unsupervised learning method with convolutional auto-encoder for vessel trajectory similarity computation10.1016/j.oceaneng.2021.108803 ↗
15. A novel similarity measure for clustering vessel trajectories based on dynamic time warping10.1017/S0373463318000723 ↗
16. Sheng, P., and Yin, J. (2018). Extracting shipping route patterns by trajectory clustering model based on automatic identification system data. Sustainability, 10.10.3390/su10072327 ↗
17. Mou, F., Fan, Z., Li, X., Wang, L., and Li, X. (2023). A method for clustering and analyzing vessel sailing routes efficiently from AIS data using traffic density images. J. Mar. Sci. Eng., 12.10.3390/jmse12010075 ↗
18. Liu, Z., Yang, H., Xiong, C., Xu, F., Gan, L., Yan, T., and Shu, Y. (2024). Research on the optimization of ship trajectory clustering based on the OD–Hausdorff distance. J. Mar. Sci. Eng., 12.10.3390/jmse12081398 ↗
19. Zicong, H., and Guan, K. (2023, January 22–24). Ship Trajectory Clustering Based on Improved Hausdorff Distance. Proceedings of the 7th International Conference on Traffic Engineering and Transportation System (ICTETS 2023), Dalian, China.10.1117/12.3016045 ↗
20. Zhang, R., Wu, H., Yin, Z., Xiao, Z., Xiong, Y., and Liu, K. (2024). Predictive Clustering of Vessel Behavior Based on Hierarchical Trajectory Representation. IEEE Trans. Intell. Transp. Syst., 19496–19506.10.1109/TITS.2024.3445496 ↗
21. KOMSA (2021). The Story of Fairway (West Coast II), Sejong, Korea Maritime Transportation Safety Authority.
22. Ship location information service using Automatic Identification System (AIS) and XML
23. IMO (1998). Adoption of New and Amended Performance Standards, IMO. Resolution MSC.74(69).
24. LCS graph kernel based on Wasserstein distance in longest common subsequence metric space10.1016/j.sigpro.2021.108281 ↗
25. Morris, B., and Trivedi, M. (2009, January 20–25). Learning trajectory patterns by clustering: Experimental studies and comparative evaluation. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Miami, FL, USA.10.1109/CVPRW.2009.5206559 ↗
26. Vlachos, M., Kollios, G., and Gunopulos, D. (March, January 26). Discovering similar multidimensional trajectories. Proceedings of the 18th International Conference on Data Engineering, Washington, DC, USA.
27. Markov processes over denumerable products of spaces, describing large systems of automata
28. Berndt, D.J., and Clifford, J. (August, January 31). Using dynamic time warping to find patterns in time series. Proceedings of the Workshop on Knowledge Discovery in Databases, Seattle, WA, USA.
29. Bergroth, L., Hakonen, H., and Raita, T. (2000, January 27–29). A survey of longest common subsequence algorithms. Proceedings of the Seventh International Symposium on String Processing and Information Retrieval, A Curuna, Spain.
30. Data dimensional reduction and principal components analysis10.1016/j.procs.2019.12.111 ↗
31. An analysis of classical multidimensional scaling with applications to clustering10.1093/imaiai/iaac004 ↗
32. Analysis of a complex of statistical variables into principal components10.1037/h0071325 ↗
33. Principal component analysis10.1002/wics.101 ↗
34. An introduction to MDS
35. Kwon, S.H. (2018). A Study on Preprocessing Guidance of Process/Operational Data for Effective Big Data Analysis. [Master’s Thesis, Gachon University].
36. Go, Y.G. (2022). A Study on the Open Dataset Collection Model in Data Science Education. [Master’s Thesis, Sungkyunkwan University].
37. How can I deal with missing data in my study?10.1111/j.1467-842X.2001.tb00294.x ↗
38. Missing data imputation using mixture factor analysis for building electric load data10.1016/j.apenergy.2021.117655 ↗
39. Park, J.R. (2021). A Study on Improving Turnover Intention Forecasting Power through Solving Imbalanced Data Problems: Focusing on SMOTE and Generative Adversarial Networks. [Ph.D. Thesis, Chungbuk National University].
40. Silhouettes: A graphical aid to the interpretation and validation of cluster analysis10.1016/0377-0427(87)90125-7 ↗
41. Ester, M., Kriegel, H.P., Sander, J., and Xu, X. A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the KDD’96, Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, OR, USA, 2–4 August 1996.
42. Kulkarni, O., and Burhanpurwala, A. (2024, January 23–24). A survey of advancements in DBSCAN clustering algorithms for big data. Proceedings of the 2024 3rd International conference on Power Electronics and IoT Applications in Renewable Energy and its Control (PARC), Mathura, India.10.1109/PARC59193.2024.10486339 ↗
43. Alahmari, A., Jamal, A., and Elazhary, H. (2021, January 27–28). Comparative Study of Common Density-Based Clustering Algorithms. Proceedings of the 2021 National Computing Colleges Conference (NCCC), Taif, Saudi Arabia.10.1109/NCCC49330.2021.9428832 ↗
44. A comparative analysis of DBSCAN, K-means, and quadratic variation algorithms for automatic identification of swallows from swallowing accelerometry signals10.1016/j.compbiomed.2015.01.007 ↗
45. VDBSCAN: Variable density clustering algorithm
46. AutoEpsilonDBSCAN: DBSCAN with epsilon automatic for large dataset
47. An improved adaptive fast AF-DBSCAN clustering algorithm