The paper discusses a new approach for incorporating hard constraints into the K-means algorithm for semi-supervised clustering. An analytic modification of the objective function of K-means is proposed that has not been previously considered in the literature.
- Hard constraints
- Semi-supervised clustering
ASJC Scopus subject areas
- Mathematics (miscellaneous)
- Psychology (miscellaneous)
- Statistics, Probability and Uncertainty
- Library and Information Sciences