Currently, there are many clustering algorithms for the case of a known/unknown number of clusters. Typically, clustering is a result of optimisation of some quality criterion or iterative process. How to estimate the quality of clustering obtained by some method? Is the clustering result corresponding to the objective reality or just a stopping criterion of the method is made and obtained some partition? In this paper, a practical approach and the general criteria based on an estimation of the stability of clustering are proposed. For the well-known clustering methods, efficient algorithms for computing the introduced stability criteria according to the training set are obtained. We give illustrative examples.
CITATION STYLE
Ryazanov, V. (2014). Estimations of clustering quality via evaluation of its stability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8827, pp. 432–439). Springer Verlag. https://doi.org/10.1007/978-3-319-12568-8_53
Mendeley helps you to discover research relevant for your work.