Skip to main content
Log in

Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

K-means clustering is arguably the most popular technique for partitioning data. Unfortunately, K-means suffers from the well-known problem of locally optimal solutions. Furthermore, the final partition is dependent upon the initial configuration, making the choice of starting partitions all the more important. This paper evaluates 12 procedures proposed in the literature and provides recommendations for best practices.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Steinley, D., Brusco, M. Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques. Journal of Classification 24, 99–121 (2007). https://doi.org/10.1007/s00357-007-0003-0

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00357-007-0003-0

Keywords