On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Authors:
- 1 January 2004
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 457-471
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- On the Convergence of Spectral Clustering on Random Samples: The Normalized CaseLecture Notes in Computer Science, 2004
- Random Matrix Approximation of Spectra of Integral OperatorsBernoulli, 2000
- Normalized cuts and image segmentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2000
- On the Quality of Spectral SeparatorsSIAM Journal on Matrix Analysis and Applications, 1998
- Asymptotics of Spectral Projections of Some Random Matrices Approximating Integral Operators1998
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel ComputationsSIAM Journal on Scientific Computing, 1995
- An improved spectral bisection algorithm and its application to dynamic load balancingParallel Computing, 1995
- New spectral methods for ratio cut partitioning and clusteringIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992
- Consistency of Single Linkage for High-Density ClustersJournal of the American Statistical Association, 1981
- Strong Consistency of $K$-Means ClusteringThe Annals of Statistics, 1981