Discriminative k-means clustering
The k-means algorithm is a partitional clustering method. Over 60 years old, it has been successfully used for a variety of problems. The popularity of k-means is in large part a consequence of its simplicity and efficiency. In this paper we are inspired by these appealing properties of k-means in the development of a clustering algorithm which accepts the notion of "positively" and "negatively" labelled data. The goal is to discover the cluster structure of both positive and negative data in a manner which allows for the discrimination between the two sets. The usefulness of this idea is demonstrated practically on the problem of face recognition, where the task of learning the scope of a person's appearance should be done in a manner which allows this face to be differentiated from others.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringFace RecognitionSimilar Papers 제목 키워드 기반
Discriminative K-means for Clustering
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and clustering. Empirical results have shown its fav…
Clusteringparameter estimationDiscriminatively Embedded K-Means for Multi-View Clustering
In real world applications, more and more data, for example, image/video data, are high dimensional and represented by multiple views which describe different perspectives of the data. Efficiently clustering such data is…
ClusteringDeep clustering: On the link between discriminative models and K-means
In the context of recent deep clustering studies, discriminative models dominate the literature and report the most competitive performances. These models learn a deep discriminative neural network classifier in which th…
ClusteringDeep ClusteringImage ClusteringregressionDIFFRAC: a discriminative and flexible framework for clustering
We present a novel linear clustering framework (Diffrac) which relies on a linear discriminative cost function and a convex relaxation of a combinatorial optimization problem. The large convex optimization problem is sol…
ClusteringCombinatorial OptimizationGeneral ClassificationDeep Fair Discriminative Clustering
Deep clustering has the potential to learn a strong representation and hence better clustering performance compared to traditional clustering methods such as $k$-means and spectral clustering. However, this strong repres…
ClusteringDeep ClusteringFairnessRepresentation Learning