Multiclass Total Variation Clustering

Ideas from the image processing literature have recently motivated a new set of clustering algorithms that rely on the concept of total variation. While these algorithms perform well for bi-partitioning tasks, their recursive extensions yield unimpressive results for multiclass clustering tasks. This paper presents a general framework for multiclass total variation clustering that does not rely on recursion. The results greatly outperform previous total variation algorithms and compare well with state-of-the-art NMF approaches.

[1]  Arjuna Flenner,et al.  Fast Multiclass Segmentation using Diffuse Interface Methods on Graphs , 2013 .

[2]  Chris H. Q. Ding,et al.  On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering , 2005, SDM.

[3]  Xavier Bresson,et al.  Convergence and Energy Landscape for Cheeger Cut Clustering , 2012, NIPS.

[4]  Matthias Hein,et al.  Beyond Spectral Clustering - Tight Relaxations of Balanced Graph Cuts , 2011, NIPS.

[5]  J. Cheeger A lower bound for the smallest eigenvalue of the Laplacian , 1969 .

[6]  Erkki Oja,et al.  Clustering by Low-Rank Doubly Stochastic Matrix Decomposition , 2012, ICML.

[7]  C. Michelot A finite algorithm for finding the projection of a point onto the canonical simplex of ∝n , 1986 .

[8]  Arthur D. Szlam,et al.  Total variation and cheeger cuts , 2010, ICML 2010.

[9]  Arthur D. Szlam,et al.  A Total Variation-based Graph Clustering Algorithm for Cheeger Ratio Cuts , 2009 .

[10]  Matthias Hein,et al.  An Inverse Power Method for Nonlinear Eigenproblems with Applications in 1-Spectral Clustering and Sparse PCA , 2010, NIPS.

[11]  Xavier Bresson,et al.  Multi-class Transductive Learning Based on ℓ1 Relaxations of Cheeger Cut and Mumford-Shah-Potts Model , 2013, Journal of Mathematical Imaging and Vision.

[12]  A. Bertozzi,et al.  AN MBO SCHEME ON GRAPHS FOR SEGMENTATION AND IMAGE PROCESSING , 2012 .

[13]  Erkki Oja,et al.  Clustering by Nonnegative Matrix Factorization Using Graph Random Walk , 2012, NIPS.

[14]  Maya R. Gupta,et al.  Clustering by Left-Stochastic Matrix Factorization , 2011, ICML.

[15]  Matthias Hein,et al.  Constrained 1-Spectral Clustering , 2012, AISTATS.

[16]  Antonin Chambolle,et al.  A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging , 2011, Journal of Mathematical Imaging and Vision.

[17]  C. Ding,et al.  On the Equivalence of Nonnegative Matrix Factorization and K-means - Spectral Clustering , 2005 .

[18]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[19]  Matthias Hein,et al.  Spectral clustering based on the graph p-Laplacian , 2009, ICML '09.

[20]  U. Feige,et al.  Spectral Graph Theory , 2015 .