Constrained Clustering and Multiple Kernel Learning without Pairwise Constraint Relaxation
This addresses the issue of poor generalization in constrained clustering for applications where users provide intuitive pairwise constraints, offering a more effective approach.
The paper tackles the problem of constrained clustering with pairwise constraints by introducing a method that jointly clusters data and learns a kernel without relaxing constraints to a continuous domain, showing improved performance on diverse datasets.
Clustering under pairwise constraints is an important knowledge discovery tool that enables the learning of appropriate kernels or distance metrics to improve clustering performance. These pairwise constraints, which come in the form of must-link and cannot-link pairs, arise naturally in many applications and are intuitive for users to provide. However, the common practice of relaxing discrete constraints to a continuous domain to ease optimization when learning kernels or metrics can harm generalization, as information which only encodes linkage is transformed to informing distances. We introduce a new constrained clustering algorithm that jointly clusters data and learns a kernel in accordance with the available pairwise constraints. To generalize well, our method is designed to maximize constraint satisfaction without relaxing pairwise constraints to a continuous domain where they inform distances. We show that the proposed method outperforms existing approaches on a large number of diverse publicly available datasets, and we discuss how our method can scale to handling large data.