Repetitive branch-and-bound and constraint programming for the clustering under constraints Vrije Universiteit Brussel
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 to clustering in Data Mining has been shown, and much attention has gone into incorporating user constraints into clustering algorithms in a generic way. Repetitive Branch-and-Bound Algorithm (RBBA) is one of the best exact approaches ...