Commute times for graph spectral clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3691 LNCS, Issue , 2005, Pages 128-136

  Qiu, Huaijun ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; GREEN'S FUNCTION; IMAGE SEGMENTATION; LAPLACE TRANSFORMS; RANDOM PROCESSES;

GRAPH LAPLACIAN; GRAPH SPECTRAL CLUSTERING; GRAPH-SPECTRAL METHOD; LAPLACIAN SPECTRUM;

GRAPH THEORY;

EID: 33646158476     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11556121_17     Document Type: Conference Paper

References (14)

1. S. Brin and L.Page. The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7):107-117, 1998.
2. F.R.K. Chung. Spectral Graph Theory. CBMS series 92. American Mathmatical Society Ed., 1997.
3. F.R.K. Chung and S.-T. Yau. Discrete green's functions. In J. Combin. Theory Ser., pages 191-214, 2000.
4. M. Gori, M. Maggini, and L. Sarti. Graph matching using random walks. In ICPR04, pages III: 394-397, 2004.
5. R. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. 19th Intl. Conf. on Machine Learning (ICML) [ICM02]., 2002.
6. L. Lovász. Random walks on graphs: A survey.
7. M. Meila and J. Shi. A random walks view of spectral segmentation, 2001.
8. M. Pavan and M. Pelillo. A new graph-theoretic approach to clustering and segmentation. In CVPR03, pages I: 145-152, 2003.
9. A. Robles-Kelly and E. R. Hancock. String edit distance, random walks and graph matching. PAMI to appear, 2005.
10. M. Saerens, F. Fouss, L. Yen, and P. Dupont. The principal components analysis of a graph, and its relationships to spectral clustering. In LN-AI, 2004.
11. S. Sarkar and K. L. Boyer. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. In CVPR, page 478, 1996.
12. G. Scott and H. Longuet-Higgins. Feature grouping by relicalisation of eigenvectors of the proximity matrix. In BMVC., pages 103-108, 1990.
13. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE PAMI, 22(8):888-905, 2000.
14. V. Sood, S. Redner, and D. ben Avraham. First-passage properties of the erdoscrenyi random graph. J. Phys. A: Math. Gen., pages 109-123, 2005.