A framework for deep constrained clustering
From MaRDI portal
Abstract: The area of constrained clustering has been extensively explored by researchers and used by practitioners. Constrained clustering formulations exist for popular algorithms such as k-means, mixture models, and spectral clustering but have several limitations. A fundamental strength of deep learning is its flexibility, and here we explore a deep learning framework for constrained clustering and in particular explore how it can extend the field of constrained clustering. We show that our framework can not only handle standard together/apart constraints (without the well documented negative effects reported earlier) generated from labeled side information but more complex constraints generated from new types of side information such as continuous values and high-level domain knowledge. Furthermore, we propose an efficient training paradigm that is generally applicable to these four types of constraints. We validate the effectiveness of our approach by empirical results on both image and text datasets. We also study the robustness of our framework when learning with noisy constraints and show how different components of our framework contribute to the final performance. Our source code is available at .
Recommendations
- On constrained spectral clustering and its applications
- Constrained clustering with a complex cluster structure
- Learning a metric when clustering data points in the presence of constraints
- Clustering with constraints: a mean-field approximation perspective
- Constrained clustering by constraint programming
Cites work
Cited in
(3)
This page was built for publication: A framework for deep constrained clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659286)