Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 789-809 |
Number of pages | 21 |
Journal | Journal of Classification |
Volume | 37 |
Issue number | 3 |
DOIs | |
Publication status | Published - Oct 2020 |
Keywords
- Hard constraints
- K-means
- Semi-supervised clustering
ASJC Scopus subject areas
- Mathematics (miscellaneous)
- Psychology (miscellaneous)
- Statistics, Probability and Uncertainty
- Library and Information Sciences