Abstract
The k-means algorithm is generally the most known and used clustering method. There are various extensions of k-means to be proposed in the literature. Although it is an unsupervised learning to clustering in pattern recognition and machine learning, the k-means algorithm and its extensions are always influenced by initializations with a necessary number of clusters a priori. That is, the k-means algorithm is not exactly an unsupervised clustering method. In this paper, we construct an unsupervised learning schema for the k-means algorithm so that it is free of initializations without parameter selection and can also simultaneously find an optimal number of clusters. That is, we propose a novel unsupervised…
Citation impact
2,115
total citations
- FWCI
- 116.56
- Percentile
- 100%
- References
- 43
Citations per year
Authors
2Topics & keywords
Topics
Keywords
- Computer science
- Cluster analysis
- Artificial intelligence
- Canopy clustering algorithm
- Unsupervised learning
- Pattern recognition (psychology)
- Correlation clustering
- Algorithm
No related works found for this paper.