In graph comparison, the use of (dis)similarity measurements between graphs is an important topic. In this work, we propose an eigendecomposition based approach for measuring dissimilarities between graphs in the joint eigenspace (JoEig). We will compare our JoEig approach with two other eigendecomposition based methods that compare graphs in different eigenspaces. To calculate the dissimilarity between graphs of different sizes and perform inexact graph comparison, we further develop three different ways to resize the eigenspectra and study their performance in different situations. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Lee, W. J., & Duin, R. P. W. (2008). An inexact graph comparison approach in joint eigenspace. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5342 LNCS, pp. 35–44). https://doi.org/10.1007/978-3-540-89689-0_8
Mendeley helps you to discover research relevant for your work.