Unsupervised K-Means Clustering Algorithm

By Kristina P. Sinaga, Miin-Shen Yang. IEEE Access, 2020

1,791 citations recorded by the source corpus.

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 k-means (U-k-means) clustering algorithm with automatically finding an optimal number of clusters without giving any initialization and parameter selection. The computational complexity of the proposed U-k-means clustering algorithm is also analyzed. Comparisons between the proposed U-k-means and other existing methods are made. Experimental results and comparisons actually demonstrate these good aspects of the proposed U-k-means clustering algorithm.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Information Systems

View Paper: https://www.semanticscholar.org/paper/b5887d18420e8ac4f4fa4c83c4952138fd956702

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Felix Naumann
  2. Moritz Feuerpfeil
  3. Nina Ihde
  4. Lukas Budach
  5. Andrea Nathansen
  6. Hendrik Patzlaff
  7. Hazar Harmouch
  8. Nele Sina Noack

In Computer Vision and Pattern Recognition

  1. Felix Naumann

In Information Systems

  1. Felix Naumann
  2. Ihab F. Ilyas

Citations in the corpus