Issue |
E3S Web Conf.
Volume 430, 2023
15th International Conference on Materials Processing and Characterization (ICMPC 2023)
|
|
---|---|---|
Article Number | 01161 | |
Number of page(s) | 13 | |
DOI | https://doi.org/10.1051/e3sconf/202343001161 | |
Published online | 06 October 2023 |
Evaluating Clustering Algorithms: An Analysis using the EDAS Method
1 Associate Professor & Dean Foreign Affairs, Department of CSE, KG Reddy College of Engineering & Technology, Moinabad, Hyderabad, Telangana - 501504
2 Associate Professor, Department of CSE, KG Reddy College of Engineering & Technology, Moinabad, Hyderabad, Telangana - 501504,
3 Professor, Department of Computer Science and Engineering, GRIET, Bachupally, Hyderabad, Telangana
4 Uttaranchal Institute of Technology, Uttaranchal University, Dehradun, 248007
a) drsivashankars@gmail.com
b) drmaithili@kgr.ac.in
Data clustering is frequently utilized in the early stages of analyzing big data. It enables the examination of massive datasets encompassing diverse types of data, with the aim of revealing undiscovered correlations, concealed patterns, and other valuable information that can be leveraged. The assessment of algorithms designed for handling large-scale data poses a significant research challenge across various fields. Evaluating the performance of different algorithms in processing massive data can yield diverse or even contradictory results, a phenomenon that remains insufficiently explored. This paper seeks to address this issue by proposing a solution framework for evaluating clustering algorithms, with the objective of reconciling divergent or conflicting evaluation outcomes. “The multicriteria decision making (MCDM) method” is used to assess the clustering algorithms. Using the EDAS rating system, the report examines six alternative clustering algorithms “the KM algorithm, EM algorithm, filtered clustering (FC), farthest-first (FF) algorithm, make density-based clustering (MD), and hierarchical clustering (HC)”—against, six clustering external measures. The Expectation Maximization (EM) algorithm has an ASi value of 0.048021 and is ranked 5th among the clustering algorithms. The Farthest-First (FF) Algorithm has an ASi value of 0.753745 and is ranked 2nd. The Filtered Clustering (FC) algorithm has an ASi value of 0.055173 and is ranked 4th. The Hierarchical Clustering (HC) algorithm has the highest ASi value of 0.929506 and is ranked 1st. The Make Density-Based Clustering (MD) algorithm has an ASi value of 0.011219 and is ranked 6th. Lastly, the K-Means Algorithm has an ASi value of 0.055376 and is ranked 3rd. These ASi values provide an assessment of each algorithm’s overall performance, and the rankings offer a comparative analysis of their performance. Based on the result, we observe that the Hierarchical Clustering algorithm achieves the highest ASi value and is ranked first, indicating its superior performance compared to the other algorithms.
Key words: Data clustering / entropy / purity / Rand index / MCDM
© The Authors, published by EDP Sciences, 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.