Machine learningMachine learning

Semi-supervised K-means

Semi-supervised K-means extends standard K-means clustering by incorporating partial supervision — either a small set of labeled seed points or pairwise must-link and cannot-link constraints — to guide cluster formation. It bridges unsupervised clustering and fully supervised classification, enabling more meaningful clusters when labels are scarce but costly to obtain in full.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. Wagstaff, K., Cardie, C., Rogers, S., & Schroedl, S. (2001). Constrained K-means Clustering with Background Knowledge. In Proceedings of the 18th International Conference on Machine Learning (ICML 2001), pp. 577–584. link
  2. Basu, S., Banerjee, A., & Mooney, R. J. (2002). Semi-supervised Clustering by Seeding. In Proceedings of the 19th International Conference on Machine Learning (ICML 2002), pp. 27–34. link

Related methods

Referenced by

ScholarGateSemi-supervised K-means (Semi-supervised K-means Clustering). Retrieved 2026-06-04 from https://scholargate.app/tr/machine-learning/semi-supervised-k-means