Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
Journal of Computational and Applied Mathematics
CURE: an efficient clustering algorithm for large databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Fast and effective text mining using linear-time document clustering
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
ACM Computing Surveys (CSUR)
A Modified Version of the K-Means Algorithm with a Distance Based on Cluster Symmetry
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cluster validity methods: part I
ACM SIGMOD Record
Quality Scheme Assessment in the Clustering Process
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Cluster ensembles --- a knowledge reuse framework for combining multiple partitions
The Journal of Machine Learning Research
Open source clustering software
Bioinformatics
Pattern Recognition, Third Edition
Pattern Recognition, Third Edition
Cluster validation using information stability measures
Pattern Recognition Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
An overview of web data clustering practices
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Some new indexes of cluster validity
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Validating synthetic health datasets for longitudinal clustering
HIKM '13 Proceedings of the Sixth Australasian Workshop on Health Informatics and Knowledge Management - Volume 142
Hi-index | 0.00 |
The procedure of evaluating the results of a clustering algorithm is known under the term cluster validity. In general terms, cluster validity criteria can be classified in three categories: internal, external and relative. In this work we focus on the external and internal criteria. External indexes require a priori data for the purposes of evaluating the results of a clustering algorithm, whereas internal indexes do not. Consequently, different types of indexes are used to solve different types of problems and indexes selection depends on the kind of available data. It is interesting to note that, type of information or algorithm notwithstanding, they provided the highest degree of accuracy in group determining. That is why in this paper we show a comparison between external and internal indexes. Results obtained in this study indicate that internal indexes are more accurate in group determining in a given clustering structure. Five internal indexes were used in this study: BIC, CH, DB, SIL and DUNN. The groups that were used were obtained through clustering algorithms K-means and Bissecting-K-means.