Clustering Algorithms: Taxonomy, Comparison, and Empirical Analysis in 2D Datasets
Because of the abundance of clustering methods, comparing between methods and determining which method is proper for a given dataset is crucial. Especially, the availability of huge experimental datasets and transactional and the emerging requirements for data mining and the like needs badly for clu...
Saved in:
| Published in: | Journal on artificial intelligence Vol. 2; no. 4; pp. 189 - 215 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Henderson
Tech Science Press
2020
|
| Subjects: | |
| ISSN: | 2579-003X, 2579-0021, 2579-003X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Because of the abundance of clustering methods, comparing between methods and determining which method is proper for a given dataset is crucial. Especially, the availability of huge experimental datasets and transactional and the emerging requirements for data mining and the like needs badly for clustering algorithms that can be applied in various domains. This paper presents essential notions of clustering and offers an overview of the significant features of the most common representative clustering algorithms of clustering categories presented in a comparative way. More specifically the study is based on the numerical type of the data that the algorithm supports, the shape of the clusters, and complexity. The experiments were done using nine clustering algorithms representing the common clustering categories on eight 2D clustered datasets differ in the clusters’ shapes and density of the data points. Furthermore, the comparison was done from the point of view seven performance measures. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2579-003X 2579-0021 2579-003X |
| DOI: | 10.32604/jai.2020.014944 |