An Inexact Graph Comparison Approach in Joint Eigenspace
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.
- 3.Debnath, A.K., Lopez de Compadre, R.L., Debnath, G., Shusterman, A.J., Hansch, C.: Structure-Activity Relationshop of Mutagenic Aromatic and Heteroaromatic Nitro Compounds. Correlation with Molecular Orbital Energies and Hydrophobicity, Journal of Medicinal Chemistry 34, 786–797 (1991)Google Scholar
- 7.Nene, S.A., Nayar, S.K., Murase, H.: Columbia University Image Library (COIL-20), http://www1.cs.columbia.edu/CAVE/software/softlib/coil-20.php
- 10.Qiu, H.J., Hancock, E.R.: Spectral Simplication of Graphs. In: Proceedings of the 8th European conference on computer vision, Czech Republic, pp. 114–126 (2004)Google Scholar
- 13.CMU Vision and Autonomous System Center’s Image Database, http://www.ius.cs.cmu.edu/idb/