Guarantees for spectral clustering with fairness constraints
Given the widespread popularity of spectral clustering (SC) for partitioning graph data, we
study a version of constrained SC in which we try to incorporate the fairness notion …
study a version of constrained SC in which we try to incorporate the fairness notion …
Semi-supervised constrained clustering: An in-depth overview, ranked taxonomy and future research directions
Clustering is a well-known unsupervised machine learning approach capable of
automatically grouping discrete sets of instances with similar characteristics. Constrained …
automatically grouping discrete sets of instances with similar characteristics. Constrained …
Active co-analysis of a set of shapes
Unsupervised co-analysis of a set of shapes is a difficult problem since the geometry of the
shapes alone cannot always fully describe the semantics of the shape parts. In this paper …
shapes alone cannot always fully describe the semantics of the shape parts. In this paper …
The human is the loop: new directions for visual analytics
Visual analytics is the science of marrying interactive visualizations and analytic algorithms
to support exploratory knowledge discovery in large datasets. We argue for a shift from a …
to support exploratory knowledge discovery in large datasets. We argue for a shift from a …
On constrained spectral clustering and its applications
X Wang, B Qian, I Davidson - Data Mining and Knowledge Discovery, 2014 - Springer
Constrained clustering has been well-studied for algorithms such as K-means and
hierarchical clustering. However, how to satisfy many constraints in these algorithmic …
hierarchical clustering. However, how to satisfy many constraints in these algorithmic …
Large graph clustering with simultaneous spectral embedding and discretization
Spectral clustering methods are gaining more and more interests and successfully applied
in many fields because of their superior performance. However, there still exist two main …
in many fields because of their superior performance. However, there still exist two main …
Semi-supervised non-negative matrix factorization with dissimilarity and similarity regularization
In this article, we propose a semi-supervised non-negative matrix factorization (NMF) model
by means of elegantly modeling the label information. The proposed model is capable of …
by means of elegantly modeling the label information. The proposed model is capable of …
Face clustering: representation and pairwise constraints
Clustering face images according to their latent identity has two important applications: 1)
grouping a collection of face images when no external labels are associated with images …
grouping a collection of face images when no external labels are associated with images …
Clustering with multi-layer graphs: A spectral perspective
Observational data usually comes with a multimodal nature, which means that it can be
naturally represented by a multi-layer graph whose layers share the same set of vertices …
naturally represented by a multi-layer graph whose layers share the same set of vertices …
[HTML][HTML] Constrained clustering by constraint programming
KC Duong, C Vrain - Artificial Intelligence, 2017 - Elsevier
Constrained Clustering allows to make the clustering task more accurate by integrating user
constraints, which can be instance-level or cluster-level constraints. Few works consider the …
constraints, which can be instance-level or cluster-level constraints. Few works consider the …