Geometric characterization and clustering of graphs using heat kernel embeddings
Authors:
- Bai XiaoBXBai Xiao
- Edwin R. HancockEdwin R. Hancock
- Richard C. WilsonRWRichard C. Wilson
- 1 June 2010
- journal article
- Published by Elsevier in Image and Vision Computing
- Vol. 28 (6) , 1003-1021
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Spectral embedding of graphsPattern Recognition, 2003
- Laplacian Eigenmaps for Dimensionality Reduction and Data RepresentationNeural Computation, 2003
- Structural graph matching using the EM algorithm and singular value decompositionIEEE Transactions on Pattern Analysis and Machine Intelligence, 2001
- Nonlinear Dimensionality Reduction by Locally Linear EmbeddingScience, 2000
- A Global Geometric Framework for Nonlinear Dimensionality ReductionScience, 2000
- Diffusions on fractals1998
- The geometry of graphs and some of its algorithmic applicationsCombinatorica, 1995
- Pattern recognition by affine moment invariantsPattern Recognition, 1993
- An eigendecomposition approach to weighted graph matching problemsIEEE Transactions on Pattern Analysis and Machine Intelligence, 1988
- Objective Criteria for the Evaluation of Clustering MethodsJournal of the American Statistical Association, 1971