In this paper we show how inexact multisubgraph matching can be solved using methods based on the projections of vertices (and their connections) into the eigenspaces of graphs - and associated clustering methods. Our analysis points to deficiencies of recent eigenspectra methods though demonstrates just how powerful full eigenspace methods can be for providing filters for such computationally intense problems. Also presented are some applications of the proposed method to shape matching, information retrieval and natural language processing.
CITATION STYLE
Kosinov, S., & Caelli, T. (2002). Inexact multisubgraph matching using graph eigenspace and clustering models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2396, pp. 133–142). Springer Verlag. https://doi.org/10.1007/3-540-70659-3_13
Mendeley helps you to discover research relevant for your work.