Graph Edit Distance from Spectral Seriation
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this, we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Pattern Analysis and Machine Intelligence|
|01_Robles-Kelly_Graph_Edit_Distance_from_2005.pdf||1.59 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.