Kempe Swap K-Means: A Scalable Near-Optimal Solution for Semi-Supervised Clustering
arXiv:2603.27417v1 Announce Type: new
Abstract: This paper presents a novel centroid-based heuristic algorithm, termed Kempe Swap K-Means, for constrained clustering under rigid must-link (ML) and cannot-link (CL) constraints. The algorithm employs a …