Abstract
In cluster analysis, finding out the number of clusters, K, for a given dataset is an important yet very tricky task, simply because there is often no universally accepted correct or wrong answer for non-trivial real world problems and it also depends on the context and purpose of a cluster study. This paper presents a new hybrid method for estimating the predominant number of clusters automatically. It employs a new similarity measure and then calculates the length of constant similarity intervals, L and considers the longest consistent intervals representing the most probable numbers of the clusters under the set context. An error function is defined to measure and evaluate the goodness of estimations. The proposed method has been tested on 3 synthetic datasets and 8 real-world benchmark datasets, and compared with some other popular methods. The experimental results showed that the proposed method is able to determine the desired number of clusters for all the simulated datasets and most of the benchmark datasets, and the statistical tests indicate that our method is significantly better.
Original language | English |
---|---|
Title of host publication | Proceedings of the 11th International Conference on Machine Learning and Applications (ICMLA) |
Publisher | The Institute of Electrical and Electronics Engineers (IEEE) |
ISBN (Print) | 978-1-4673-4651-1 |
DOIs | |
Publication status | Published - 11 Jan 2013 |
Event | 11th International Conference on Machine Learning and Applications (ICMLA) - , United Kingdom Duration: 12 Dec 2012 → 15 Dec 2012 |
Conference
Conference | 11th International Conference on Machine Learning and Applications (ICMLA) |
---|---|
Country/Territory | United Kingdom |
Period | 12/12/12 → 15/12/12 |
Keywords
- Clustering
- Similarity measure
- k-means clustering algorithm