Non-negative and sparse spectral clustering
Authors:
- Hongtao LuHLHongtao Lu
- Zhenyong FuZFZhenyong Fu
- Xin ShuXSXin Shu
- 1 January 2014
- journal article
- research article
- Published by Elsevier in Pattern Recognition
- Vol. 47 (1) , 418-426
Abstract
No abstract availableKeywords
Funding Information
- NSFC (61272247, 60873133, 2009CB320901, 2008AA02Z310)
- China and the European Union Seventh Framework Programme (247619)
This publication has 17 references indexed in Scilit:
- Multiway Spectral Clustering: A Margin-Based PerspectiveStatistical Science, 2008
- A tutorial on spectral clusteringStatistics and Computing, 2007
- Orthogonal nonnegative matrix t-factorizations for clustering2006
- Sparse Principal Component AnalysisJournal of Computational and Graphical Statistics, 2006
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering2005
- K-means clustering via principal component analysis2004
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- New spectral methods for ratio cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- An improved two-way partitioning algorithm with stable performance (VLSI)IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1991