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.

[1]  Stephen J. Roberts,et al.  Minimum-Entropy Data Clustering Using Reversible Jump Markov Chain Monte Carlo , 2001, ICANN.

[2]  Woncheol Jang,et al.  Cluster analysis of massive datasets in astronomy , 2007, Stat. Comput..

[3]  Pedro Larrañaga,et al.  An empirical comparison of four initialization methods for the K-Means algorithm , 1999, Pattern Recognit. Lett..

[4]  Roberto Cipolla,et al.  Automatic Cast Listing in Feature-Length Films with Anisotropic Manifold Space , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[5]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[6]  P. McCullagh,et al.  How many clusters , 2008 .

[7]  G LoweDavid,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004 .

[8]  Thomas Brox,et al.  Higher order motion models and spectral clustering , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[9]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[10]  S. Dasgupta.  The hardness of k-means clustering , 2008 .

[11]  Sheng-Wen Shih,et al.  Learning Atomic Human Actions Using Variable-Length Markov Models , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  David G. Stork,et al.  Pattern Classification (2nd ed.) , 1999 .

[13]  Anil K. Jain.  Data clustering: 50 years beyond K-means , 2008, Pattern Recognit. Lett..

[14]  Cordelia Schmid,et al.  Aggregating local descriptors into a compact image representation , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  Shehroz S. Khan,et al.  Cluster center initialization algorithm for K-means clustering , 2004, Pattern Recognit. Lett..

[16]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[17]  Andrew Zisserman,et al.  Smooth object retrieval using a bag of boundaries , 2011, 2011 International Conference on Computer Vision.

[18]  Frank M. Shipman,et al.  Adaptive clustering and interactive visualizations to support the selection of video clips , 2011, ICMR '11.

[19]  Ognjen Arandjelovic,et al.  Multiple-object Tracking in Cluttered and Crowded Public Spaces , 2010, ISVC.

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

[21]  Ognjen Arandjelovic,et al.  Contextually Learnt Detection of Unusual Motion-Based Behaviour in Crowded Public Spaces , 2013, ISCIS.

[22]  Ognjen Arandjelovic,et al.  Object Matching Using Boundary Descriptors , 2012, BMVC.

[23]  Shigeo Abe DrEng.  Pattern Classification , 2001, Springer London.

[24]  Maria-Florina Balcan,et al.  Active Clustering of Biological Sequences , 2012, J. Mach. Learn. Res..