Spectral clustering with more than K eigenvectors
Authors:
- 1 April 2011
- journal article
- research article
- Published by Elsevier in Neurocomputing
- Vol. 74 (9) , 1391-1401
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Spectral clustering with eigenvector selection based on entropy rankingNeurocomputing, 2010
- Spectral clustering with eigenvector selectionPattern Recognition, 2008
- From graph to manifold Laplacian: The convergence rateApplied and Computational Harmonic Analysis, 2006
- On the largest principal angle between random subspacesLinear Algebra and its Applications, 2006
- The efficient evaluation of the hypergeometric function of a matrix argumentMathematics of Computation, 2006
- A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-PartitioningJournal of Global Optimization, 2004
- Spectral partitioning with multiple eigenvectorsDiscrete Applied Mathematics, 1999
- Recent directions in netlist partitioning: a surveyIntegration, 1995
- An optimal graph theoretic approach to data clustering: theory and its application to image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 1993
- New spectral methods for ratio cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992