Constrained K-means with General Pairwise and Cardinality Constraints

07/24/2019
by   Adel Bibi, et al.
0

In this work, we study constrained clustering, where constraints are utilized to guide the clustering process. In existing works, two categories of constraints have been widely explored, namely pairwise and cardinality constraints. Pairwise constraints enforce the cluster labels of two instances to be the same (must-link constraints) or different (cannot-link constraints). Cardinality constraints encourage cluster sizes to satisfy a user-specified distribution. However, most existing constrained clustering models can only utilize one category of constraints at a time. In this paper, we enforce the above two categories into a unified clustering model starting with the integer program formulation of the standard K-means. As these two categories provide useful information at different levels, utilizing both of them is expected to allow for better clustering performance. However, the optimization is difficult due to the binary and quadratic constraints in the proposed unified formulation. To alleviate this difficulty, we utilize two techniques: equivalently replacing the binary constraints by the intersection of two continuous constraints; the other is transforming the quadratic constraints into bi-linear constraints by introducing extra variables. Then we derive an equivalent continuous reformulation with simple constraints, which can be efficiently solved by Alternating Direction Method of Multipliers (ADMM) algorithm. Extensive experiments on both synthetic and real data demonstrate: (1) when utilizing a single category of constraint, the proposed model is superior to or competitive with state-of-the-art constrained clustering models, and (2) when utilizing both categories of constraints jointly, the proposed model shows better performance than the case of the single category.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2019

Deep Constrained Clustering - Algorithms and Advances

The area of constrained clustering has been extensively explored by rese...
research
10/24/2018

A Binary Optimization Approach for Constrained K-Means Clustering

K-Means clustering still plays an important role in many computer vision...
research
06/28/2018

A probabilistic constrained clustering for transfer learning and image category discovery

Neural network-based clustering has recently gained popularity, and in p...
research
03/23/2022

Constrained Clustering and Multiple Kernel Learning without Pairwise Constraint Relaxation

Clustering under pairwise constraints is an important knowledge discover...
research
11/30/2021

An Exact Algorithm for Semi-supervised Minimum Sum-of-Squares Clustering

The minimum sum-of-squares clustering (MSSC), or k-means type clustering...
research
01/30/2018

COBRA: A Fast and Simple Method for Active Clustering with Pairwise Constraints

Clustering is inherently ill-posed: there often exist multiple valid clu...
research
05/25/2021

Principal Component Hierarchy for Sparse Quadratic Programs

We propose a novel approximation hierarchy for cardinality-constrained, ...

Please sign up or login with your details

Forgot password? Click here to reset