TY  - CONF
AU  - Ng, Andrew Y.
AU  - Jordan, Michael I.
AU  - Weiss, Yair
A2  - 
T1  - On spectral clustering: Analysis and an algorithm
T2  - Advances in Neural Information Processing Systems 14
PB  - MIT Press
C1  - 
PY  - 2001/
CY  -  
VL  - 
IS  - 
SP  - 849
EP  - 856
UR  - 
DO  - 
KW  - clustering
KW  - community
KW  - detection
KW  - graph
KW  - spectral
KW  - theory
L1  - 
SN  - 
N1  - 
N1  - 
AB  - Despite many empirical successes of spectral clustering methods| algorithms that cluster points using eigenvectors of matrices derived from the data|there are several unresolved issues. First, there are a wide variety of algorithms that use the eigenvectors in slightly dierent ways. Second, many of these algorithms have no proof that they will actually compute a reasonable clustering. In this paper, we present a simple spectral clustering algorithm that can be implemented using a few lines of Matlab. Using tools from matrix perturbation theory, we analyze the algorithm, and give conditions under which it can be expected to do well. We also show surprisingly good experimental results on a number of challenging clustering problems. 1
ER  -

TY  - UNPB
AU  - Ranade, A.G.
A2  - 
T1  - Some uses of spectral methods
PY  - 2000/
SP  - 
EP  - 
UR  - 
DO  - 
KW  - clustering
KW  - graph
KW  - spectral
KW  - svd
KW  - theory
L1  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - RPRT
AU  - Spielman, Daniel A.
AU  - Teng, Shang
A2  - 
T1  - Spectral Partitioning Works: Planar Graphs and Finite Element Meshes
PB  - 
AD  - Berkeley, CA, USA
PY  - 1996/
VL  - 
IS  - 
SP  - 
EP  - 
UR  - 
DO  - 
KW  - clustering
KW  - community
KW  - detection
KW  - graph
KW  - spectral
KW  - survey
KW  - theory
L1  - 
N1  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Pothen, A.
AU  - Simon, H.D.
AU  - Liou, K.P.
T1  - Partitioning Sparse Matrices with Eigenvectors of Graphs
JO  - SIAM J. MATRIX ANAL. APPLIC.
PY  - 1990/
VL  - 11
IS  - 3
SP  - 430
EP  - 452
UR  - http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19970011963_1997016998.pdf 
DO  - 
KW  - clustering
KW  - community
KW  - graph
KW  - partitioning
KW  - spectral
KW  - theory
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -

TY  - JOUR
AU  - Donath, W.E.
AU  - Hoffman, A.J.
T1  - Lower bounds for the partitioning of graphs
JO  - IBM Journal of Research and Development
PY  - 1973/
VL  - 17
IS  - 5
SP  - 420
EP  - 425
UR  - 
DO  - 
KW  - clustering
KW  - community
KW  - detection
KW  - graph
KW  - spectral
KW  - theory
L1  - 
SN  - 
N1  - 
N1  - 
AB  - 
ER  -