Repetitive Branch-and-Bound Using Constraint Programming for Constrained Minimum Sum-of-Squares Clustering
Tias Guns, Dao Thi-Bich-Hanh, Christel Vrain, Khanh-Chuong Duong · Frontiers in artificial intelligence and applications · 2016
Minimum sum-of-squares clustering (MSSC) is a widely studied task and numerous approximate as well as a number of exact algorithms have been developed for it. Recently the interest of integrating prior knowledge in data mining has been shown, and much attention has gone into incorporating user constraints into clustering algorithms in a generic way.