Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Evaluating Clustering Algorithms: An Analysis using the EDAS Method

View through CrossRef
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.
Title: Evaluating Clustering Algorithms: An Analysis using the EDAS Method
Description:
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.

Related Results

The Earth Data Analytic Services (EDAS) Framework
The Earth Data Analytic Services (EDAS) Framework
Faced with unprecedented growth in earth data volume and demand, NASA has developed the Earth Data Analytic Services (EDAS) framework, a high performance big data analytics and mac...
Revolutionizing FinTech with Event-Driven Architectures
Revolutionizing FinTech with Event-Driven Architectures
This article serves as a comprehensive guide for financial technology architects, FinTech executives, and software engineers seeking to leverage Event-Driven Architectures (EDAs) i...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Indirect revascularization for pediatric moyamoya disease
Indirect revascularization for pediatric moyamoya disease
OBJECTIVE Indirect revascularization is a common and effective treatment for pediatric moyamoya disease. However, in several cases postoperative angiogenesis is not sufficient. It ...
How suitable are clustering methods for functional annotation of proteins?
How suitable are clustering methods for functional annotation of proteins?
Abstract The advent of affordable high-throughput genome sequencing has drastically expanded protein sequence databases, necessitating the development of computatio...
An Ensemble Clustering Method Based on Several Different Clustering Methods
An Ensemble Clustering Method Based on Several Different Clustering Methods
Abstract As an unsupervised learning method, clustering is done to find natural groupings of patterns, points, or objects. In clustering algorithms, an important problem is...
Clustering Analysis of Data with High Dimensionality
Clustering Analysis of Data with High Dimensionality
Clustering analysis has been widely applied in diverse fields such as data mining, access structures, knowledge discovery, software engineering, organization of information systems...
Sistem Pendukung Keputusan untuk Optimalisasi Penghapusan Aktiva Tetap Menggunakan Metode CRITIC dan Fuzzy EDAS
Sistem Pendukung Keputusan untuk Optimalisasi Penghapusan Aktiva Tetap Menggunakan Metode CRITIC dan Fuzzy EDAS
Manajemen aktiva tetap di perguruan tinggi sering menghadapi kendala dalam menentukan penghapusan aset secara objektif akibat perbedaan skala antar kriteria serta adanya subjektivi...

Back to Top