Citation :

Chaimae FAIZ, Mouna EL MKHALET, Mohammed SBIHI, "Application of Clustering Techniques for the Analysis and Classification of Firms in the Automotive Industry," International Journal of Engineering Trends and Technology (IJETT), vol. 74, no. 7, pp. 522-546, 2026. Crossref, https://doi.org/10.14445/22315381/IJETT-V74I7P131

Abstract

According to this study, five clustering algorithms are compared theoretically and experimentally. The clustering algorithms are DBSCAN, KMeans, Spectral Clustering, OPTICS, and K-Medoids. By using 20 automotive companies’ financial data, we evaluate the performance of each algorithm based on intra- and inter-cluster variance, noise robustness, and data perturbation sensitivity. The results demonstrate that the K-Means technique demonstrates the highest stability towards data variation, while the DBSCAN and OPTICS techniques are able to handle noise and discover clusters of different arbitrary shapes. Although spectral clustering is capable of capturing nonlinear structures, it is more sensitive to parameter changes. K-Medoids uses real data points as cluster centers, thereby providing robustness to outliers. One of the novel contributions of this work is the sensitivity analysis, which highlights the method’s robustness or fragility under controlled perturbations of the data. Each of these deductions is useful in choosing clustering methods according to the application.

Keywords

Clustering algorithms, Customer segmentation, Density-based clustering, Sensitivity analysis, Unsupervised learning.

References

[1] Mayra Z. Rodriguez et al., “Clustering Algorithms: A Comparative Approach,” PloS One, vol. 14, no. 1, pp. 1-34, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[2] Elie Aljalbout et al., “Clustering with Deep Learning: Taxonomy and New Method,” arXiv Preprint, pp. 1-12, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[3] Anil K. Jain, M. Narasimha Murty, and Patrick J. Flynn, “Data Clustering: A Review,” ACM Computing Surveys (CSUR), vol. 31, no. 3, pp. 264-323, 1999.
[CrossRef] [Google Scholar] [Publisher Link]

[4] T. Warren Liao, “Clustering of Time Series Data-A Survey,” Pattern Recognition, vol. 38, no. 11, pp. 1857-1874, 2005.
[CrossRef] [Google Scholar] [Publisher Link]

[5] Indranil Bose, and Xi Chen, “Detecting the Migration of Mobile Service Customers using Fuzzy Clustering,” Information & Management, vol. 52, no. 2, pp. 227-238, 2015.
[CrossRef] [Google Scholar] [Publisher Link]

[6] Delvin Grant, and Benjamin Yeo, “A Global Perspective on Tech Investment, Financing, and ICT on Manufacturing and Service Industry Performance,” International Journal of Information Management, vol. 43, pp. 130-145, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[7] Sergey Samoilenko, Kweku-Muata Osei-Bryson, “Representation Matters: An Exploration of the Socio-Economic Impacts of ICT-Enabled Public Value in the Context of Sub-Saharan Economies,” International Journal of Information Management, vol. 49, pp. 69-85, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[8] Wen-Bo Xie et al., “Hierarchical Clustering Supported by Reciprocal Nearest Neighbors,” Information Sciences, vol. 527, pp. 279-292, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[9] Gbeminiyi John Oyewole, and George Alex Thopil, “Data Clustering: Application and Trends,” Artifcial Intelligence Review, vol. 56, no. 7, pp. 6439-6475, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[10] Muhamed Ali Syakur et al., “Integration k-Means Clustering Method and Elbow Method for Identification of the Best Customer Profile Cluster,” IOP Conference Series, Materials Science and Engineering: The 2^nd International Conference on Vocational Education and Electrical Engineering (ICVEE), Surabaya, Indonesia, vol. 336, no. 1, pp. 1-7, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[11] Charu C. Aggarwal, and Chandan K. Reddy, Data Clustering: Algorithms and Applications, Chapman and Hall/CRC Press, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[12] Tasnim Alasalı, and Yasin Ortakcı, “Clustering Techniques in Data Mining: A Survey of Methods, Challenges, and Applications,” Journal of Computer Science, vol. 9, no. 1, pp. 32-50, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[13] Sheng Zhou et al., “A Comprehensive Survey on Deep Clustering : Taxonomy, Challenges, and Future Directions,” ACM Computing Surveys, vol. 57, no. 3, pp. 1-38, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[14] Yazhou Ren et al., “Deep Clustering : A Comprehensive Survey,” IEEE Transactions on Neural Networks and Learning Systems, vol. 36, no. 4, pp. 5858-5878, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[15] Lior Rokach, and Oded Maimon, Clustering Methods, Data Mining and Knowledge Discovery Handbook, Springer, Boston, MA, pp. 321-352, 2005.
[CrossRef] [Google Scholar] [Publisher Link]

[16] Glenn Fung, “A Comprehensive Overview of Basic Clustering Algorithms,” pp. 1-37, 2001.
[Google Scholar]

[17] Absalom E. Ezugwu et al., “A Comprehensive Survey of Clustering Algorithms: State-of-the-Art Machine Learning Applications, Taxonomy, Challenges, and Future Research Prospects,” Engineering Applications of Artificial Intelligence, vol. 110, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[18] Anitha Ramchandran, and Arun Kumar Sangaiah, Chapter 11 - Unsupervised Anomaly Detection for High Dimensional Data—an Exploratory Analysis, Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications, Academic Press, pp. 233-251, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[19] Mohiuddin Ahmed, and Abdun Naser Mahmood, “Novel Approach for Network Traffic Pattern Analysis using Clustering-based Collective Anomaly Detection,” Annals of Data Science, vol. 2, no. 1, pp. 111-130, 2015.
[CrossRef] [Google Scholar] [Publisher Link]

[20] Pang-Ning Tan, Michael Steinbach, and Vipin Kumar, Introduction to Data Mining, 2^nd ed., Pearson Education, 2019.
[Google Scholar] [Publisher Link]

[21] Olfa Nasraoui, and Chiheb-Eddine Ben N'Cir, Clustering Methods for Big Data Analytics, Techniques, Toolboxes and Applications, Springer, Cham, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[22] Jelili Oyelade et al., “Data Clustering: Algorithms and its Applications,” 2019 19^th International Conference on Computational Science and its Applications (ICCSA), pp. 71-81, 2019.
[CrossRef] [Google Scholar] [Publisher Link] 

[23] Mohammed A. Ahmed, Hanif Baharin, and Puteri N.E. Nohuddin, “Analysis of k-means, DBSCAN, and OPTICS Cluster Algorithms on Al-Quran Verses,” International Journal of Advanced Computer Science and Applications (IJACSA), vol. 11, no. 8, pp. 248-254, 2020.
[CrossRef] [Google Scholar] [Publisher Link] 

[24] Michael Hahsler, Matthew Piekenbrock, Derek Doran, “dbscan: Fast Density-based Clustering with R,” Journal of Statistical Software, vol. 91, no. 1, pp. 1-30, 2019.
[CrossRef] [Google Scholar] [Publisher Link] 

[25] Harn Tung Ng, Haidi Ibrahim, and Parvathy Rajendran, “Statistical-based Methods to Improve Precision of DBSCAN Clustering Algorithm for Obstacle Detection Application in Autonomous Vehicles,” Multimedia Tools and Applications, vol. 84, no. 38, pp. 47101-47125, 2025.
[CrossRef] [Google Scholar] [Publisher Link] 

[26] Adil Abdu Bushra, and Gangman Yi, “Comparative Analysis Review of Pioneering DBSCAN and Successive Density-based Clustering Algorithms,” IEEE Access, vol. 9, pp. 87918-87935, 2021.
[CrossRef] [Google Scholar] [Publisher Link] 

[27] Artur Starczewski, Piotr Goetzen, and Meng Joo Er, “A New Method for Automatic Determining of the DBSCAN Parameters,” Journal of Artificial Intelligence and Soft Computing Research, vol. 10, no. 3, pp. 209-221, 2020.
[CrossRef] [Google Scholar] [Publisher Link] 

[28] Wenhao Lai et al., “A New DBSCAN Parameters Determination Method based on Improved MVO,” IEEE Access, vol. 7, pp. 104085-104095, 2019.
[CrossRef] [Google Scholar] [Publisher Link] 

[29] Yewang Chen et al., “A Fast Clustering Algorithm based on Pruning Unnecessary Distance Computations in DBSCAN for High-Dimensional Data,” Pattern Recognition, vol. 83, pp. 375-387, 2018.
[CrossRef] [Google Scholar] [Publisher Link] 

[30] Diego Luchi, Alexandre Loureiros Rodrigues, Flavio Miguel Varejao, “Sampling Approaches for Applying DBSCAN to Large Datasets,” Pattern Recognition Letters, vol. 117, pp. 90-96, 2018.
[CrossRef] [Google Scholar] [Publisher Link]  

[31] Dino Ienco, and Gloria Bordogna, “Fuzzy Extensions of the DBSCAN Clustering Algorithm,” Soft Computing, vol. 22, no. 5, pp. 1719-1730, 2018.
[CrossRef] [Google Scholar] [Publisher Link]  

[32] Zeinab Falahiazar, Alireza Bagheri, and Midia Reshadi, “Determining the Parameters of DBSCAN Automatically using the Multi-Objective Genetic Algorithm,” Journal of Information Science and Engineering, vol. 37, no. 1, pp. 157-183, 2021.
[Google Scholar] [Publisher Link]  

[33] Hui Yin et al., “A Rapid Review of Clustering Algorithms,” arXiv Preprint, pp. 1-25, 2024.
[CrossRef] [Google Scholar] [Publisher Link]  

[34] Tingting Xie et al., “3D Surface Segmentation from Point Clouds via Quadric Fits based on DBSCAN Clustering,” Pattern Recognition, vol. 154, 2024.
[CrossRef] [Google Scholar] [Publisher Link]  

[35] Muhammad Usman Hanif et al., “A Novel Method for Acoustic Emission Source Location in CFRP-Concrete Debonding Using ΔT Mapping and DBSCAN Algorithm,” Measurement, vol. 236, 2024.
[CrossRef] [Google Scholar] [Publisher Link]  

[36] Jongwon Kim, Hyeseon Lee, and Young Myoung Ko, “Constrained Density-Based Spatial Clustering of Applications with Noise (DBSCAN) using Hyperparameter Optimization,” Knowledge-based Systems, vol. 303, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[37]Dong Gyu Park et al., “DBSCAN and Yolov5 based 3D Object Detection and its Adaptation to a Mobile Platform,” Mechatronics, vol. 103, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[38]Akanksha Tandon, and Sanjeev Patel, “DBSCAN based Approach for Energy Efficient VM Placement using Medium Level CPU Utilization,” Sustainable Computing: Informatics and Systems, vol. 43, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[39] Xianmeng Tu et al., “DBSCAN Clustering Model for Parameter Inversion using Laser Cutting Edge Morphology Characteristic in Zr-4 Alloy,” Optics & Laser Technology, vol. 184, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[40] Camilo Alberto Caudillo-Cos et al., “Defining Urban Boundaries through DBSCAN and Shannon's Entropy: The Case of the Mexican National Urban System,” Cities, vol. 149, pp. 1-33, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[41] Dongdong Cheng et al., “GB-DBSCAN: A fast Granular-ball based DBSCAN Clustering Algorithm,” Information Sciences, vol. 674, pp. 1-34, 2023.
 [CrossRef] [Google Scholar] [Publisher Link]

[42] Xiaogang Huang, Tiefeng Ma, Conan Liu, Shuangzhe Liu, “GriT-DBSCAN: A Spatial Clustering Algorithm for Very Large Databases,” Pattern Recognition, vol. 142, pp. 1-18, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[43] Yishuo Jiang et al., “Heterogeneous Intensity-based DBSCAN (iDBSCAN) Model for Urban Attention Distribution in Digital Twin Cities,” Digital Engineering, vol. 2, pp. 1-19, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[44] Fehmi Can Ozer, Hediye Tuydes-Yaman, and Gulcin Dalkic-Melek, “Increasing the Precision of Public Transit User Activity Location Detection from Smart Card Data Analysis via Spatial-Temporal DBSCAN,” Data & Knowledge Engineering, vol. 153, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[45] Jiaxin Qian et al., “MDBSCAN: A Multi-Density DBSCAN based on Relative Density,” Neurocomputing, vol. 576, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[46] M. Raja et al., “Membership Determination in Open Clusters using the DBSCAN Clustering Algorithm,” Astronomy and Computing, vol. 47, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[47] Yang Shichuna et al., “Multi-Scenario Failure Diagnosis for Lithium-Ion Battery based on Coupling PSO-SA-DBSCAN Algorithm,” Journal of Energy Storage, vol. 99, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[48] Nitin Newaliya, and Yudhvir Singh, “Multivariate Hierarchical DBSCAN Model for Enhanced Maritime Data Analytics,” Data & Knowledge Engineering, vol. 150, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[49] Yan Tu, Zhenxing Tang, and Benjamin Lev, “Regional Flood Risk Grading Assessment Considering Indicator Interactions among Hazard, Exposure, and Vulnerability: A Novel FlowSort with DBSCAN,” Journal of Hydrology, vol. 639, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[50] Kamran Mardani, Keivan Maghooli, and Fardad Farokhi, “Segmentation of Coronary Arteries from X-Ray Angiographic Images using Density based Spatial Clustering of Applications with Noise (DBSCAN),” Biomedical Signal Processing and Control, vol. 101, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[51] Xiao-Dong Wang et al., “Fast Adaptive K-Means Subspace Clustering for High-Dimensional Data,” IEEE Access, vol. 7, pp. 42639-42651, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[52] Erich Schubert et al., “DBSCAN Revisited, Revisited: Why and how you should (Still) Use DBSCAN,” ACM Transactions on Database Systems (TODS), vol. 42, no. 3, pp. 1-21, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[53] Wani Aasim Ayaz, “Comprehensive Analysis of Clustering Algorithms: Exploring Limitations and Innovative Solutions,” PeerJ Computer Science, vol. 10, pp. 1-45, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[54] Mahnoor Chaudhry et al., “A Systematic Literature Review on Identifying Patterns using Unsupervised Clustering Algorithms: A Data Mining Perspective,” Symmetry, vol. 15, no. 9, pp. 1-44, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[55] Ramzi A. Haraty, Mohamad Dimishkieh, and Mehedi Masud, “An Enhanced k-Means Clustering Algorithm for Pattern Discovery in Healthcare Data,” International Journal of Distributed Sensor Networks, vol. 11, no. 6, pp. 1-11, 2015.
[CrossRef] [Google Scholar] [Publisher Link]

[56] Kristina P. Sinaga, and Min-Shen Yang, “Unsupervised K-Means Clustering Algorithm,” IEEE Access, vol. 8, pp. 80716-80727, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[57] Kamal Uddin Sarker et al., “A Ranking Learning Model by k-Means Clustering Technique for Web Scraped Movie Data,” Computers, vol. 11, no. 11, pp. 1-21, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[58] Xindong Wu et al., “Top 10 Algorithms in Data Mining,” Knowledge and Information Systems, vol. 14, no. 1, pp. 1-37, 2008.
[CrossRef] [Google Scholar] [Publisher Link]

[59] Absalom E. Ezugwu et al., “Automatic Clustering Algorithms: A Systematic Review and Bibliometric Analysis of Relevant Literature,” Neural Computing and Applications, vol. 33, no. 11, pp. 6247-6306, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[60] Nicholas C. Spies et al., “Machine Learning Methods in Clinical Flow Cytometry,” Cancers, vol. 17, no. 3, pp. 1-26, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[61] Mohiuddin Ahmed, Raihan Seraj, and Syed Mohammed Shamsul Islam, “The k-means Algorithm: A Comprehensive Survey and Performance Evaluation,” Electronics, vol. 9, no. 8, pp. 1-12, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[62] Min Wei, Tommy Wai-Shun Chow, and Rosa Hoi-Man Chan, “Clustering Heterogeneous Data with k-Means by Mutual Information-based Unsupervised Feature Transformation,” Entropy, vol. 17, no. 3, pp. 1535-1548, 2015.
[CrossRef] [Google Scholar] [Publisher Link]

[63] Tal Gaon, Yovel Gabay, and Miri Weiss Cohen, “Optimizing Electric Vehicle Routing Efficiency using K-Means Clustering and Genetic Algorithms,” Future Internet, vol. 17, no. 3, pp. 1-19, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[64] Yordan Petrov Raykov, Alexis Boukouvalas, Fahd Baig, Max A. Little, “What to do when K- Means Clustering Fails: A Simple yet Principled Alternative Algorithm,” Plos One, vol. 11, no. 9, pp. 1-28, 2016.
[CrossRef] [Google Scholar] [Publisher Link]

[65] Jiahu Qin et al., “Distributed k-Means Algorithm and Fuzzy c-Means Algorithm for Sensor Networks based on Multiagent Consensus Theory,” IEEE Transactions on Cybernetics, vol. 47, no. 3, pp. 772-783, 2016.
[CrossRef] [Google Scholar] [Publisher Link]

[66] Hong Liu et al., “Spectral Ensemble Clustering Via Weighted K-Means: Theoretical and Practical Evidence,” IEEE Transactions on Knowledge and Data Engineering, vol. 29, no. 5, pp. 1129-1143, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[67] Caizhi Zhang., “Review of Clustering Technology and its Application in Coordinating Vehicle Subsystems,” Automotive Innovation, vol. 6, no. 1, pp. 89-115, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[68] Marcio Trindade Guerreiro et al., “Anomaly Detection in Automotive Industry using Clustering Methods-A Case Study,” Applied Sciences, vol. 11, no. 21, pp. 1-23, 2021.
[CrossRef] [Google Scholar] [Publisher Link]

[69] Jian Yuan, and Yufei Tian, “Practical Privacy-Preserving MapReduce based K-Means Clustering Over Large-Scale Dataset,” IEEE Transactions on Cloud Computing, vol. 7, no. 2, pp. 568-579, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[70] Jinglin Xu et al., “Re-Weighted Discriminatively Embedded k-Means for Multi-View Clustering,” IEEE Transactions on Image Processing, vol. 26, no. 6, pp. 3016-3027, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[71] Wenbin Wu, and Mugen Peng, “A Data Mining Approach Combining K-Means Clustering with Bagging Neural Network for Short-Term Wind Power Forecasting,” IEEE Internet of Things Journal, vol. 4, no. 4, pp. 979-986, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[72] Jing Yang, and Jun Wang, “Tag Clustering Algorithm LMMSK: Improved k-Means Algorithm based on Latent Semantic Analysis,” Journal of Systems Engineering and Electronics, vol. 28, no. 2, pp. 374-384, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[73]Xian Zeng et al., “A Novel Virtual Sensing with Artificial Neural Network and K-Means Clustering for IGBT Current Measuring,” IEEE Transactions on Industrial Electronics, vol. 65, no. 9, pp. 7343-7352, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[74] Li He, and Hong Zhang, “Kernel K-Means Sampling for Nyström Approximation,” IEEE Transactions on Image Processing, vol. 27, no. 5, pp. 2108-2120, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[75] Xiaopeng Yang et al., “Fast and Robust RBF Neural Network based on Global K-Means Clustering with Adaptive Selection Radius for Sound Source Angle Estimation,” IEEE Transactions on Antennas and Propagation, vol. 66, no. 6, pp. 3097-3107, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[76] Liang Bai, Jiye Liang, Yike Guo, “An Ensemble Clusterer of Multiple Fuzzy K-Means Clusterings to Recognize Arbitrarily Shaped Clusters,” IEEE Transactions on Fuzzy Systems, vol. 26, no. 6, pp. 3524-3533, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[77] Vincent Schellekens, and Laurent Jacques, “Quantized Compressive K-Means,” IEEE Signal Processing Letters, vol. 25, no. 8, pp. 1211-1215, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[78] Mohammad Alhawarat, and Mohamed Hegazi, “Revisiting K-Means and Topic Modeling, A Comparison Study to Cluster Arabic Documents,” IEEE Access, vol. 6, pp. 42740-42749, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[79] Yue Fei Wang et al., “A New Outlier Detection Method based on OPTICS,” Sustainable Cities and Society, vol. 45, pp. 197-212, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[80] Wojciech Kwedlo, and Piotr J. Czochanski, “A Hybrid MPI/Openmp Parallelization of K-Means Algorithms Accelerated using the Triangle Inequality,” IEEE Access, vol. 7, pp. 42280-42297, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[81] Shermeen Yousif, and Wei Yan, “Application and Evaluation of a K-Medoids-based Shape Clustering Method for an Articulated Design Space,” Journal of Computational Design and Engineering, vol. 8, no. 3, pp. 935-948, 2021.
[CrossRef] [Google Scholar] [Publisher Link]

[82] Yonghao Gu et al., “Semi-Supervised K-Means DDoS Detection Method using Hybrid Feature Selection Algorithm,” IEEE Access, vol. 7, pp. 64351-64365, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[83] Preeti Arora, Deepali Virmani, Shipra Varshney, “Analysis of K-Means and K-Medoids Algorithm for Big Data,” Procedia Computer Science, vol. 78, pp. 507-512, 2016.
[CrossRef] [Google Scholar] [Publisher Link]

[84] Sukavanan Nanjundan et al., “Identifying the Number of Clusters for K-Means: A Hypersphere Density based Approach,” arXiv Preprint, pp. 1-5, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[85] Johannes Blomer et al., Theoretical Analysis of the K-Means Algorithm-A Survey, Algorithm Engineering, Springer, Cham, pp. 81-116, 2016.
[CrossRef] [Google Scholar] [Publisher Link]

[86] Rocco Langone et al., Kernel Spectral Clustering and Applications, Unsupervised Learning Algorithms, Springer, Cham, pp. 135-161, 2016.
[CrossRef] [Google Scholar] [Publisher Link]

[87] Xiaofeng Zhu et al., “One-Step Multi-View Spectral Clustering,” IEEE Transactions on Knowledge and Data Engineering, vol. 31, no. 10, pp. 2022-2034, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[88] Xiaofeng Zhu et al., “Robust Joint Graph Sparse Coding for Unsupervised Spectral Feature Selection,” IEEE Transactions on Neural Networks and Learning Systems, vol. 28, no. 6, pp. 1263-1275, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[89] Ulrike von Luxburg, “A Tutorial on Spectral Clustering,” Statistics and Computing, vol. 17, no. 4, pp. 395-416, 2007.
[CrossRef] [Google Scholar] [Publisher Link]

[90] Jiarong Shi, and Zhiteng Wang, “A Hybrid Forecast Model for Household Electric Power by Fusing Landmark-based Spectral Clustering and Deep Learning,” Sustainability, vol. 14, no. 15, pp. 1-21, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[91] David Zhuzhunashvili, and Andrew Knyazev, “Preconditioned Spectral Clustering for Stochastic Block Partition Streaming Graph Challenge,” 2017 IEEE High Performance Extreme Computing Conference (HPEC), Waltham, MA, USA, pp. 1-6, 2017.
[CrossRef] [Google Scholar] [Publisher Link]

[92] Desmond J. Higham, Gabriela Kalna, and Milla Kibble, “Spectral Clustering and its Use in Bioinformatics,” Journal of Computational and Applied Mathematics, vol. 204, no. 1, pp. 25-37, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[93] Angel Mur et al., “Determination of the Optimal Number of Clusters using a Spectral Clustering Optimization,” Expert Systems with Applications, vol. 65, pp. 304-314, 2016.
[CrossRef] [Google Scholar] [Publisher Link]

[94] Frederick Tung, Alexander Wong, and David A. Clausi, “Enabling Scalable Spectral Clustering for Image Segmentation,” Pattern Recognition, vol. 43, no. 12, pp. 4069-4076, 2010.
[CrossRef] [Google Scholar] [Publisher Link] 

[95] Kamal Berahmand et al., “A Comprehensive Survey on Spectral Clustering with Graph Structure Learning,” arXiv preprint, pp. 1-21, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[96] Hongjie Jia, Liangjun Wang, and Heping Song, “Large-Scale Spectral Clustering with Stochastic Nyström Approximation,” Intelligent Information Processing X: 11^th IFIP TC 12 International Conference, IIP 2020, Hangzhou, China, vol. 581, pp. 26-34, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[97] S. Meenakshi, and R. Renukadevi, “A Review on Spectral Clustering and its Applications,” International Journal of Innovative Research in Computer and Communication Engineering, vol. 4, no. 8, pp. 14840-14845, 2016.
[Google Scholar] [Publisher Link]

[98] Yingbo Song, and Kapil Thadani, “Spectral Clustering of Time Series Data,” Colombia University, 2006.
[Google Scholar]

[99] Lingfei Wu et al., “Scalable Spectral Clustering using Random Binning Features,” Proceedings of the 24^th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, New York, NY, United States, pp. 2506-2515, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[100] Bartłomiej Starosta et al., “Explainable Graph Spectral Clustering of Text Documents,” PLOS one, vol. 20, no. 2, pp. 1-41, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[101] Zhibo Dong et al., “BLADE: Behavior-Level Anomaly Detection using Network Traffic in Web Services,” 2025 21^st International Conference on Mobility, Sensing and Networking (MSN), Bandung, Indonesia, pp. 221-228, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[102] Vinod Kumar et al., “Deep Learning for Hyperspectral Image Classification: A Survey,” Computer Science Review, vol. 53, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[103] Yixuan Li et al., “Local Spectral Clustering for Overlapping Community Detection,” ACM Transactions on Knowledge Discovery from Data (TKDD), vol. 12, no. 2, pp. 1-27, 2018.
[CrossRef] [Google Scholar] [Publisher Link]

[104] Jeen Mary John, Olamilekan Shobayo, and Bayode Ogunleye, “An Exploration of Clustering Algorithms for Customer Segmentation in the UK Retail Market,” Analytics, vol. 2, no. 4, pp. 810-823, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[105] Alberto Paccanaro, James A. Casbon, and Mansoor A.S. Saqi, “Spectral Clustering of Protein Sequences,” Nucleic Acids Research, vol. 34, no. 5, pp. 1571-1580, 2006.
[CrossRef] [Google Scholar] [Publisher Link]

[106] Abdulhady Abas Abdullah et al., “Advanced Clustering Techniques for Speech Signal Enhancement: A Review and Meta-Analysis of Fuzzy C-Means, K-Means, and Kernel Fuzzy C-Means Methods,” arXiv preprint, pp. 1-26, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[107] Sangeeta Rani, and Geeta Sikka, “Recent Techniques of Clustering of Time Series Data: A Survey,” International Journal of Computer Applications, vol. 52, no. 15, pp. 1-9, 2012.
[Google Scholar]

[108] Hodjat (Hojatollah) Hamidi, and Bahare Haghi, “An Approach based on Data Mining and Genetic Algorithm to Optimizing Time Series Clustering for Efficient Segmentation of Customer Behavior,” Computers in Human Behavior Reports, vol. 16, pp. 1-18, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[109] Vanessa Frias-Martinez, and Enrique Frias-Martinez, “Spectral Clustering for Sensing Urban Land use using Twitter Activity,” Engineering Applications of Artificial Intelligence, vol. 35, pp. 237-245, 2014.
[CrossRef] [Google Scholar] [Publisher Link]

[110] Wenke Zang, Zhenni Jiang, and Liyan Ren, “Improved Spectral Clustering Based on Density Combining DNA Genetic Algorithm,” International Journal of Pattern Recognition and Artificial Intelligence, vol. 31, no. 4, pp. 1-23, 2017.
[CrossRef] [Google Scholar] [Publisher Link] 

[111] Paola Favati et al., “Construction of the Similarity Matrix for the Spectral Clustering Method: Numerical Experiments,” Journal of Computational and Applied Mathematics, vol. 375, pp. 1-11, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[112] Serge Iovlef et al., “Advanced Graph Clustering: A Review of Traditional and Deep Learning Approaches,” SSRN, pp. 1-29, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[113] Farhad Pourkamali-Anaraki, “Scalable Spectral Clustering with Nystrom Approximation: Practical and Theoretical Aspects,” IEEE Open Journal of Signal Processing, vol. 1, pp. 242-256, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[114] Yu Zhu, and Santiago Segarra, “Hypergraphs with Edge-Dependent Vertex Weights: p- Laplacians and Spectral Clustering,” arXiv Preprint, pp. 1-22, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[115] Scott White, and Padhraic Smyth, “A Spectral Clustering Approach to Finding Communities in Graphs,” Proceedings of the 2005 SIAM International Conference on Data Mining, pp. 274-285, 2005.
[CrossRef] [Google Scholar] [Publisher Link]

[116] Yang Zhao, Yuan Yuan, and Qi Wang, “Fast Spectral Clustering for Unsupervised Hyperspectral Image Classification,” Remote Sensing, vol. 11, no. 4, pp. 1-21, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[117] Jialu Liu, and Jiawei Han, Spectral Clustering, Data Clustering, 1^st ed., Chapman and Hall/CRC, 2014.
[Google Scholar] [Publisher Link]

[118] Youming Guo et al., “Adaptive Optics based on Machine Learning: A Review,” Opto-Electronic Advances, vol. 5, no. 7, pp. 1-20, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[119] Guanran Wang et al., “Estimation of Forest Canopy Height using ATLAS Data based on Improved Optics and EEMD Algorithms,” Remote Sensing, vol. 17, no. 5, pp. 1-19, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[120] Emily Grabowski, and Jennifer Kuo, “Comparing K-Means, and OPTICS Clustering Algorithms for Identifying Vowel Categories,” Proceedings of the Linguistic Society of America, vol. 8, no. 1, pp. 1-10, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[121] Mustafa Al Samaraa et al., “Complete Outlier Detection and Classification Framework for WSNs based on OPTICS,” Journal of Network and Computer Applications, vol. 211, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[122] Martin Ester et al., “A Density based Algorithm for Discovering Clusters in Large Spatial Databases with Noise,” Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, Portland, Oregon, pp. 226-231, 1996.
[Google Scholar] [Publisher Link]

[123] Hai-Xia Ma et al., “sOPTICS: A Modified Density-based Algorithm for Identifying Galaxy Groups/Clusters and Brightest Cluster Galaxies,” Monthly Notices of the Royal Astronomical Society, vol. 537, no. 2, pp. 1504-1517, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[124] Jiawei Han, Micheline Kamber, and Jian Pei, Data Mining Concepts and Technique, Morgan Kaufman Publisher, 2011.
[Google Scholar] [Publisher Link]

[125] Xiaoxiao Zhu et al., “A Noise Removal Algorithm based on OPTICS for Photon-Counting LiDAR Data,” IEEE Geoscience and Remote Sensing Letters, vol. 18, no. 8, pp. 1471-1475, 2021.
[CrossRef] [Google Scholar] [Publisher Link]

[126] Daren Wang, Xinyang Lu, and Alessandro Rinaldo, “DBSCAN: Optimal Rates for Density-based Cluster Estimation,” Journal of Machine Learning Research, vol. 20, no. 170, pp. 1-50, 2019.
[Google Scholar] [Publisher Link]

[127] Mohammed Omari et al., “Advancing Image Compression through Clustering Techniques: A Comprehensive Analysis,” Technologies, vol. 13, no. 3, pp. 1-54, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[128] Yan Zhang, Weiyu Shi, and Yeqing Sun, “A Functional Gene Module Identification Algorithm in Gene Expression Data based on Genetic Algorithm and Gene Ontology,” BMC Genomics, vol. 24, no. 1, pp. 1-18, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[129] Jaafar Sadiq Alrubaye, and Behrouz Shahgholi Ghahfarokhi, “Resource-Aware DBSCAN-based Re-Clustering in Hybrid C-V2X/DSRC Vehicular Networks,” PLOS One, vol. 18, no. 10, pp. 1-23, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[130] Chunhua Tang et al., “An Improved OPTICS Clustering Algorithm for Discovering Clusters with Uneven Densities,” Intelligent Data Analysis: An International Journal, vol. 25, no. 6, pp. 1453-1471, 2021.
[CrossRef] [Google Scholar] [Publisher Link]

[131] S. Babichev et al., “Application of Optics Density-based Clustering Algorithm using Inductive Methods of Complex System Analysis,” 2019 IEEE 14^th International Conference on Computer Sciences and Information Technologies (CSIT), Lviv, Ukraine, pp. 169-172, 2019.
[CrossRef] [Google Scholar] [Publisher Link]

[132] Yuhang Zhao et al., “An Independent Central Point OPTICS Clustering Algorithm for Semi-Supervised Outlier Detection of Continuous Glucose Measurements,” Biomedical Signal Processing and Control, vol. 71, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[133] S. Velunachiyar, and K. Sivakumar, “Some Clustering Methods, Algorithms and Their Applications,” International Journal on Recent and Innovation Trends in Computing and Communication, vol. 11, no. 6s, pp. 401-410, 2023.
[CrossRef] [Google Scholar] [Publisher Link]

[134] Novia Hasdyna, and Rozzi Kesuma Dinata, “Comparative Analysis of K-Medoids and Purity K- Medoids Methods for Identifying Accident-Prone Areas in North Aceh Regency,” Scientific Journal of Informatics, vol. 11, no. 2, pp. 263-272, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[135] Brady Lund, and Jinxuan Ma, “A Review of Cluster Analysis Techniques and Their Uses in Library and Information Science Research: K-Means and K-Medoids Clustering,” Performance Measurement and Metrics, vol. 22, no. 3, pp. 161-173, 2021.
[CrossRef] [Google Scholar] [Publisher Link]

[136] Antoine de Mathelin et al., “OneBatchPAM: A Fast and Frugal K-Medoids Algorithm,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 39, no. 15, pp. 16172-16180, 2025.
[CrossRef] [Google Scholar] [Publisher Link]

[137] Hae-Sang Park, and Chi-Hyuck Jun, “A Simple and Fast Algorithm for K-Medoids Clustering,” Expert Systems with Applications, vol. 36, no. 2, pp. 3336-3341, 2009.
[CrossRef] [Google Scholar] [Publisher Link]

[138] Emilia Herman, Kinga-Emese Zsido, and Veronika Fenyves, “Cluster Analysis with K-Mean versus K-Medoid in Financial Performance Evaluation,” Applied Sciences, vol. 12, no. 16, pp. 1-19, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[139] Hazrul Anshari Ulvi, and Muhammad Ikhsan, “Comparison of K-Means and K-Medoids Clustering Algorithms for Export and Import Grouping of Goods in Indonesia,” Sinkron: Journal and Research of Informatics Engineering, vol. 8, no. 3, pp. 1671-1685, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[140] Noor Kamal Kaur, Usvir Kaur, and Dheerendra Singh, “K-Medoid Clustering Algorithm-A Review,” International Journal of Computer Applications & Technology (IJCAT), vol. 1, no. 1, pp. 42-45, 2014.
[Google Scholar]

[141] Swathi Dsouza, Jevita Deena Dsouza, T. Vanitha, “Analysis of Data using K-Means and K-Medoids Algorithms,” International Journal of Latest Trends in Engineering and Technology, Special Issue SACAIM, pp. 370-373, 2017.
[Google Scholar] [Publisher Link]

[142] Huang Chenan, and Narumasa Tsutsumida, “A Scalable K-Medoids Clustering via Whale Optimization Algorithm,” Array, vol. 28, pp. 1-12, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[143] Antônio Sobrinho Campolina Martins, Leandro Ramos de Araujo, and Débora Rosana Ribeiro Penido, “K-Medoids Clustering Applications for High-Dimensionality Multiphase Probabilistic Power Flow,” International Journal of Electrical Power & Energy Systems, vol. 157, pp. 1-16, 2024.
[CrossRef] [Google Scholar] [Publisher Link]

[144] Zengyuan Wu et al., “Research on Segmenting E-Commerce Customers through an Improved K-Medoids Clustering Algorithm,” Computational Intelligence and Neuroscience, vol. 2022, pp. 1-10, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[145] Sanjit Kumar Saha, and Ingo Schmitt, “Non-TI Clustering in the Context of Social Networks,” Procedia Computer Science, vol. 170, pp. 1186-1191, 2020.
[CrossRef] [Google Scholar] [Publisher Link]

[146] Chenyang Lu et al., “Federated Learning based on Optics Clustering Optimization,” Discrete Dynamics in Nature and Society, vol. 2022, no. 1, 2022.
[CrossRef] [Google Scholar] [Publisher Link]

[147] Tagaram Soni Madhulatha, “Comparison between K-Means and K-Medoids Clustering Algorithms,” International Conference on Advances in Computing and Information Technology, Chennai, India, pp. 472-481, 2011.
[CrossRef] [Google Scholar] [Publisher Link]