Iterative clustering


Reading time: less than 1 minute

Iterative clustering is a method for Clustering points with the goal of making evenly-sized clusters. It can be considered a really basic way to perform hierarchical clustering.

Some clustering algorithms may yield sub-optimal results when asked for a large number of clusters. While this is generally not a problem for unsupervised ML, it is a problem if you know how many clusters you are going to need, for example when splitting similar data into N clusters.

Let’s say you want to end up with K clusters. Instead of asking the clustering algorithm for K clusters, just ask it to split your data in two.

  1. Find the biggest cluster, or the only cluster
  2. Split the points into two clusters
  3. If there are K distinct cluster labels, stop. Otherwise, go to 1.

Citation

If you find this work useful, please cite it as:
@article{yaltirakli,
  title   = "Iterative clustering",
  author  = "Yaltirakli, Gokberk",
  journal = "gkbrk.com",
  year    = "2024",
  url     = "https://www.gkbrk.com/iterative-clustering"
}
Not using BibTeX? Click here for more citation styles.
IEEE Citation
Gokberk Yaltirakli, "Iterative clustering", November, 2024. [Online]. Available: https://www.gkbrk.com/iterative-clustering. [Accessed Nov. 12, 2024].
APA Style
Yaltirakli, G. (2024, November 12). Iterative clustering. https://www.gkbrk.com/iterative-clustering
Bluebook Style
Gokberk Yaltirakli, Iterative clustering, GKBRK.COM (Nov. 12, 2024), https://www.gkbrk.com/iterative-clustering

Comments

© 2024 Gokberk Yaltirakli