Cluster validity and stability of clustering algorithms

3Citations
Citations of this article
105Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For many clustering algorithms, it is very important to determine an appropriate number of clusters, which is called cluster validity problem. In this paper, we offer a new approach to tackle this issue. The main point is that the better outputs of clustering algorithm, the more stable. Therefore, we establish the relation between cluster validity and stability of clustering algorithms, and propose that the conditional number of Hessian matrix of the objective function with respect to outputs of the clustering algorithm can be used as cluster validity cluster index. Based on such idea, we study the traditional fuzzy c-means algorithms. Comparison experiments suggest that such a novel cluster validity index is valid for evaluating the performance of the fuzzy c-means algorithms. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Yu, J., Huang, H., & Tian, S. (2004). Cluster validity and stability of clustering algorithms. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3138, 957–965. https://doi.org/10.1007/978-3-540-27868-9_105

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free