Skip navigation
Skip navigation

Graph Edit Distance from Spectral Seriation

Robles-Kelly, Antonio; Hancock, Edwin R

Description

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]

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
URI: http://hdl.handle.net/1885/81444
Source: IEEE Transactions on Pattern Analysis and Machine Intelligence

Download

File Description SizeFormat Image
01_Robles-Kelly_Graph_Edit_Distance_from_2005.pdf1.59 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator