This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Semi-Supervised Kernel Mean Shift Clustering
PrePrint
ISSN: 0162-8828
Saket Anand, Rutgers University, Piscataway
Sushil Mittal, Scibler Technologies, Bangalore
Oncel Tuzel, Mitsubishi Electric Research Laboratories, Cambridge
Peter Meer, Rutgers University, Piscataway
Mean shift clustering is a powerful nonparametric technique that does not require prior knowledge of the number of clusters and does not constrain the shape of the clusters. However, being completely unsupervised, its performance suffers when the original distance metric fails to capture the underlying cluster structure. Despite recent advances in semi-supervised clustering methods, there has been little effort towards incorporating supervision into mean shift. We propose a semi-supervised framework for kernel mean shift clustering (SKMS) that uses only pairwise constraints to guide the clustering procedure. The points are first mapped to a high-dimensional kernel space where the constraints are imposed by a linear transformation of the mapped points. This is achieved by modifying the initial kernel matrix by minimizing a log det divergence-based objective function.We show the advantages of SKMS by evaluating its performance on various synthetic and real datasets while comparing with state-of-the-art semi-supervised clustering algorithms.
Index Terms:
Vectors,Clustering algorithms,Null space,Symmetric matrices,Clustering methods,Computer vision,Algorithms,Clustering,Similarity measures,Computer vision,Applications,Pattern Recognition,Computing Methodologies
Citation:
Saket Anand, Sushil Mittal, Oncel Tuzel, Peter Meer, "Semi-Supervised Kernel Mean Shift Clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence, 20 Nov. 2013. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.190>
Usage of this product signifies your acceptance of the Terms of Use.