arXiv Analytics

Sign in

arXiv:1901.10061 [cs.LG]AbstractReferencesReviewsResources

Deep Constrained Clustering - Algorithms and Advances

Hongjing Zhang, Sugato Basu, Ian Davidson

Published 2019-01-29Version 1

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. We explore a deep learning formulation of constrained clustering and in particular explore how it can extend the field of constrained clustering. We show that our formulation can not only handle standard together/apart constraints without the well documented negative effects reported but can also model instance level constraints (level-of-difficulty), cluster level constraints (balancing cluster size) and triplet constraints. The first two are new ways for domain experts to enforce guidance whilst the later importantly allows generating ordering constraints from continuous side-information.

Related articles: Most relevant | Search more
arXiv:1404.7456 [cs.LG] (Published 2014-04-28)
Automatic Differentiation of Algorithms for Machine Learning
arXiv:1410.6382 [cs.LG] (Published 2014-10-23)
Attribute Efficient Linear Regression with Data-Dependent Sampling
arXiv:2003.10113 [cs.LG] (Published 2020-03-23)
Algorithms for Non-Stationary Generalized Linear Bandits