Abstract
In this paper, we investigate the use of heat kernels as a means of embedding graphs in a pattern space. We commence by performing the spectral decomposition on the graph Laplacian. The heat kernel of the graph is found by exponentiating the resulting eigensystem over time. By equating the spectral heat kernel and its Gaussian form we are able to approximate the geodesic distance between nodes on a manifold. We use the resulting pattern of distances to embed the trees in a Euclidean space using multidimensional scaling. The arrangement of points in this space can be used to construct pattern vectors suitable for clustering the graphs. Here we compute a weighted proximity matrix, and from the proximity matrix a Laplacian matrix is computed. We use the eigenvalues of the Laplacian matrix to characterise the distribution of points representing the embedded nodes. Experiments on sets of shock graphs reveal the utility of the method on real-world data.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Alexandrov, A.D., Zalgaller, V.A.: Intrinsic geometry of surfaces. Transl. Math. Monographs 15 (1967)
Ranicki, A.: Algebraic l-theory and topological manifolds. Cambridge University Press, Cambridge (1992)
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. Neural Information Processing Systems 14, 634–640 (2002)
Hjaltason, G.R., Samet, H.: Properties of embedding methods for similarity searching in metric spaces. PAMI 25, 530–549 (2003)
Grigor’yan, A.: Heat kernels on manifolds, graphs and fractals (2003) (preprint)
Busemann, H.: The geometry of geodesics. Academic Press, London (1955)
Tenenbaum, J.B., Silva, V.D., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 586–591 (2000)
Lafferty, J., Lebanon, G.: Diffusion kernels on statistical manifolds (2004) (CMU preprint)
Coulhon, T., Barlow, M., Grigor’yan, A.: Manifolds and graphs with slow heat kernel decay (2000) (imperial college preprint)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some its algorithmic application. Combinatorica 15, 215–245 (1995)
Smola, A.J., Kondor, R.: Kernels and regularisation of graphs (2004)
Weinberger, S.: Review of algebraic l-theory and topological manifolds by a.ranicki. BAMS 33, 93–99 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, X., Hancock, E.R. (2004). Heat Kernels, Manifolds and Graph Embedding. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds) Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2004. Lecture Notes in Computer Science, vol 3138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27868-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-27868-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22570-6
Online ISBN: 978-3-540-27868-9
eBook Packages: Springer Book Archive