Spectral Sparse Representation for Clustering: Evolved from PCA,
K-means, Laplacian Eigenmap, and Ratio Cut

v1v2v3v4 (latest)

Spectral Sparse Representation for Clustering: Evolved from PCA, K-means, Laplacian Eigenmap, and Ratio Cut

25 March 2014

Gang Pan

ArXiv (abs)PDF HTML

Papers citing "Spectral Sparse Representation for Clustering: Evolved from PCA, K-means, Laplacian Eigenmap, and Ratio Cut"

8 / 8 papers shown

Title
Dimensionality Reduction for k-Means Clustering and Low Rank Approximation Michael B. Cohen Sam Elder Cameron Musco Christopher Musco Madalina Persu 119 358 0 24 Oct 2014
Sparse Principal Component Analysis via Rotation and Truncation Zhenfang Hu Gang Pan Yueming Wang Zhaohui Wu 68 45 0 06 Mar 2014
Provable Bounds for Learning Some Deep Representations Sanjeev Arora Aditya Bhaskara Rong Ge Tengyu Ma BDL 97 335 0 23 Oct 2013
New Algorithms for Learning Incoherent and Overcomplete Dictionaries Sanjeev Arora Rong Ge Ankur Moitra 77 205 0 28 Aug 2013
Representation Learning: A Review and New Perspectives Yoshua Bengio Aaron Courville Pascal Vincent OOD SSL 269 12,439 0 24 Jun 2012
Sparse Subspace Clustering: Algorithm, Theory, and Applications Ehsan Elhamifar René Vidal 109 2,334 0 05 Mar 2012
Robust Recovery of Subspace Structures by Low-Rank Representation Guangcan Liu Zhouchen Lin Shuicheng Yan Ju Sun Yong Yu Yi-An Ma 127 3,224 0 14 Oct 2010
A Tutorial on Spectral Clustering U. V. Luxburg 290 10,537 0 01 Nov 2007

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.