Development of an Intelligent Hybrid Clustering Algorithm Based on Depth Data and Grid Mapping for Automatic Parameter Estimation


Authors

  • Sutrisno Sutrisno Universitas Medan Area, Medan, Indonesia
  • Sandy Ardiansyah Universitas Medan Area, Medan, Indonesia
  • Hartono Hartono Universitas Medan Area, Medan, Indonesia
  • Sayuti Rahman Universitas Medan Area, Medan, Indonesia

Keywords:

Clustering; K-Means; Hybrid Algorithm; Data Depth; Grid-Mapping; Automatic Parameter Estimation

Abstract

The K-Means algorithm is one of the most popular clustering methods; however, it has notable weaknesses, particularly its reliance on an arbitrary selection of the number of clusters (K) and its sensitivity to the initialization of centroid positions. Traditional K-Means often exhibits unstable performance and is vulnerable to noise, while many cluster validity indices (CVIs) used to determine the optimal K also suffer from limitations related to computational complexity and efficiency. Although advanced approaches—such as grid-based clustering and Data Depth–based estimation methods—have been developed to address these issues, many of them still require manual intervention to determine key parameters, which becomes an obstacle in creating a fully autonomous clustering system.

To overcome these challenges, this study proposes the development of an Intelligent Hybrid Clustering Algorithm that integrates Grid-Mapping with the concept of Data Depth for automatic parameter estimation. The Grid-Mapping approach is employed due to its proven speed, stability, and robustness against noise by transforming data into a grid-based representation. Meanwhile, the Data Depth concept is utilized as a foundation for efficiently and accurately estimating the optimal number of clusters (K) without the need for repeated full clustering processes. The main innovation of this research lies in creating an automated mechanism for determining crucial parameters, thus eliminating the need for manual user input. With the integration of these two approaches, the proposed algorithm is expected to offer a clustering solution that is not only accurate and efficient but also more intelligent and adaptive, capable of operating autonomously across various data scenarios.

References

Blocher, H., & Schollmeyer, G. (2025). Data depth functions for non-standard data by use of formal concept analysis. Journal of Multivariate Analysis, 205(September 2024), 105372. https://doi.org/10.1016/j.jmva.2024.105372

Ghany, K. K. A., AbdelAziz, A. M., Soliman, T. H. A., & Sewisy, A. A. E. M. (2022). A hybrid modified step Whale Optimization Algorithm with Tabu Search for data clustering. Journal of King Saud University - Computer and Information Sciences, 34(3), 832–839. https://doi.org/10.1016/j.jksuci.2020.01.015

Guo, L., Qin, W., Cai, Z., & Su, X. (2024). Hybrid Clustering Algorithm Based on Improved Density Peak Clustering. Applied Sciences (Switzerland), 14(2). https://doi.org/10.3390/app14020715

Irigoien, I., Ferreiro, S., Sierra, B., & Arenas, C. (2023). Fuzzy classification with distance-based depth prototypes: High-dimensional unsupervised and/or supervised problems. Applied Soft Computing, 148(September), 110917. https://doi.org/10.1016/j.asoc.2023.110917

Karlik, B. (2025). Hybrid Learning?: The Impact of Clustering Algorithms on Supervised Machine Learning 15 . Hybrid Learning?: The Impact of Clustering Algorithms on Supervised Machine Learning. July.

Khan, A. A., Bashir, M. S., Batool, A., Raza, M. S., & Bashir, M. A. (2024). K-Means Centroids Initialization Based on Differentiation Between Instances Attributes. International Journal of Intelligent Systems, 2024(1). https://doi.org/10.1155/2024/7086878

Khan, I. K., Daud, H. B., Zainuddin, N. B., Sokkalingam, R., Farooq, M., Baig, M. E., Ayub, G., & Zafar, M. (2024). Determining the optimal number of clusters by Enhanced Gap Statistic in K-mean algorithm. Egyptian Informatics Journal, 27(May), 100504. https://doi.org/10.1016/j.eij.2024.100504

Ördek, B., Coatanea, E., & Borgianni, Y. (2025). An auto hierarchical clustering algorithm to distinguish geometries suitable for additive and traditional manufacturing technologies: Comparing humans and unsupervised learning. Results in Engineering, 25(November 2024). https://doi.org/10.1016/j.rineng.2025.104418

Patil, C., & Baidari, I. (2019). Estimating the Optimal Number of Clusters k in a Dataset Using Data Depth. Data Science and Engineering, 4(2), 132–140. https://doi.org/10.1007/s41019-019-0091-y

Prastyabudi, W. A., Alifah, A. N., & Nurdin, A. (2024). Segmenting the Higher Education Market: An Analysis of Admissions Data Using K-Means Clustering. Procedia Computer Science, 234(2023), 96–105. https://doi.org/10.1016/j.procs.2024.02.156

Pugazhenthi, A., & Kumar, L. S. (2020). Selection of Optimal Number of Clusters and Centroids for K-means and Fuzzy C-means Clustering: A Review. Proceedings of the 2020 International Conference on Computing, Communication and Security, ICCCS 2020, October 2020. https://doi.org/10.1109/ICCCS49678.2020.9276978

Pugliese, R., Regondi, S., & Marini, R. (2021). Machine learning-based approach: Global trends, research directions, and regulatory standpoints. Data Science and Management, 4(November), 19–29. https://doi.org/10.1016/j.dsm.2021.12.002

Ramírez-Díaz, A. J., Martínez-Trinidad, J. F., & Carrasco-Ochoa, J. A. (2025). A Clustering Algorithm for Large Datasets Based on Detection of Density Variations. Mathematics, 13(14). https://doi.org/10.3390/math13142272

Salehin, I., Islam, M. S., Saha, P., Noman, S. M., Tuni, A., Hasan, M. M., & Baten, M. A. (2024). AutoML: A systematic review on automated machine learning with neural architecture search. Journal of Information and Intelligence, 2(1), 52–81. https://doi.org/10.1016/j.jiixd.2023.10.002

Sarker, I. H. (2021). Machine Learning: Algorithms, Real-World Applications and Research Directions. SN Computer Science, 2(3). https://doi.org/10.1007/s42979-021-00592-x

Tareq, M., Sundararajan, E. A., Harwood, A., & Bakar, A. A. (2022). A Systematic Review of Density Grid-Based Clustering for Data Streams. IEEE Access, 10, 579–596. https://doi.org/10.1109/ACCESS.2021.3134704

Utami, P. Y. (2023). Analisis clustering k-means pada pengelompokkan titik panas kebakaran hutan dan lahan. Jurnal Pendidikan Informatika Dan Sains, 12(1), 165–172. https://doi.org/10.31571/saintek.v12i1.6001

Wahyudi, M., Solikhun, S., & Pujiastuti, L. (2022). Komparasi K-Means Clustering dan K-Medoids Clustering dalam Mengelompokkan Produksi Susu Segar di Indonesia Berdasarkan Nilai DBI. Jurnal Bumigora Information Technology (BITe), 4(2), 243–254. https://doi.org/10.30812/bite.v4i2.2104

Zhu, E., Zhang, Y., Wen, P., & Liu, F. (2019). Fast and stable clustering analysis based on Grid-mapping K-means algorithm and new clustering validity index. Neurocomputing, 363, 149–170. https://doi.org/10.1016/j.neucom.2019.07.048


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Development of an Intelligent Hybrid Clustering Algorithm Based on Depth Data and Grid Mapping for Automatic Parameter Estimation

Dimensions Badge

ARTICLE HISTORY

Published: 2026-01-25

Abstract View: 154 times
PDF Download: 71 times

How to Cite

Sutrisno, S., Ardiansyah, S., Hartono, H., & Rahman, S. (2026). Development of an Intelligent Hybrid Clustering Algorithm Based on Depth Data and Grid Mapping for Automatic Parameter Estimation. Proceeding of International Conference Technology, Economics, and Social Science, 1(1), 749-757. Retrieved from https://journals.adaresearch.or.id/ictess/article/view/133