Discriminative Exemplar clustering

Exemplar-based clustering methods partition the data space and identify the representative, or the exemplar, of each cluster. With the number of clusters adaptively determined, exemplar-based clustering methods are appealing since they avoid or alleviate the difficult task of estimating the latent parameters in case of complex models and high dimensionality of the data. Most exemplar-based clustering methods are based on generative models, where the exemplars serve as the parameters of the generative models. However, generative models do not consider the discriminative capability of the cluster boundaries explicitly described in discriminative models. In this paper, we present Discriminative Exemplar Clustering (DEC), that improves the discriminative power of exemplar-based clustering method by minimizing the misclassification error of the nonparametric unsupervised plug-in classifier while maintaining the appealing property of exemplar-based clustering. The optimization of DEC is performed in a pairwise Markov Random Field. Experimental results on synthetic and real data demonstrate the effectiveness of our method compared to other exemplar-based clustering methods.

[1]  Andreas Krause,et al.  Discriminative Clustering by Regularized Information Maximization , 2010, NIPS.

[2]  Polina Golland,et al.  Convex Clustering with Exemplar-Based Models , 2007, NIPS.

[3]  Shachar Lovett,et al.  Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem , 2012, COLT.

[4]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[5]  Rikiya Takahashi,et al.  Sequential Minimal Optimization in Adaptive-Bandwidth Convex Clustering , 2011, SDM.

[6]  David Haussler,et al.  Exploiting Generative Models in Discriminative Classifiers , 1998, NIPS.

[7]  Dale Schuurmans,et al.  Maximum Margin Clustering , 2004, NIPS.

[8]  Masashi Sugiyama,et al.  On Information-Maximization Clustering: Tuning Parameter Selection and Analytic Solution , 2011, ICML.

[9]  L. Hubert,et al.  Comparing partitions , 1985 .

[10]  Zhuowen Tu,et al.  Discriminative Clustering via Generative Feature Mapping , 2012, AAAI.

[11]  Delbert Dueck,et al.  Clustering by Passing Messages Between Data Points , 2007, Science.

[12]  Brendan J. Frey,et al.  A Binary Variable Model for Affinity Propagation , 2009, Neural Computation.

[13]  Adrian E. Raftery,et al.  Model-Based Clustering, Discriminant Analysis, and Density Estimation , 2002 .

[14]  David Barber,et al.  Kernelized Infomax Clustering , 2005, NIPS.

[15]  Brendan J. Frey,et al.  Semi-Supervised Affinity Propagation with Instance-Level Constraints , 2009, AISTATS.

[16]  William T. Freeman,et al.  On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.