Succinct initialization methods for clustering algorithms

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we focus on the problem of unsupervised clustering of a data-set. We introduce the traditional K-Means (K-means) cluster analysis and fuzzy C-means (FCM) cluster analysis of the principles and algorithms process at first, then a novel method to initialize the cluster centers is proposed. The idea is that the cluster centers' distribution should be as evenly as possible within the input field. A "Two-step method" is used in our evolutionary models, with evolutionary algorithms to get the initialized centers, and traditional methods to get the final results. Experiment results show our initialization method can speed up the convergence, and in some cases, make the algorithm performs better. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Liang, X., Ren, S., & Yang, L. (2011). Succinct initialization methods for clustering algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6838 LNCS, pp. 47–54). https://doi.org/10.1007/978-3-642-24728-6_7

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