A survey of graph edit distance

Gao, X; Xiao, B; Tao, D; Li, X

A survey of graph edit distance

Gao, X Xiao, B Tao, D

Li, X

Permalink

Publication Type:: Journal Article
Citation:: Pattern Analysis and Applications, 2010, 13 (1), pp. 113 - 129
Issue Date:: 2010-01-01

Closed Access

	Filename	Description	Size
	2011000259OK.pdf		541.03 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Gao, X	en_US
dc.contributor.author	Xiao, B	en_US
dc.contributor.author	Tao, D https://orcid.org/0000-0001-7225-5449	en_US
dc.contributor.author	Li, X	en_US
dc.date.issued	2010-01-01	en_US
dc.identifier.citation	Pattern Analysis and Applications, 2010, 13 (1), pp. 113 - 129	en_US
dc.identifier.issn	1433-7541	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15103
dc.description.abstract	Inexact graph matching has been one of the significant research foci in the area of pattern analysis. As an important way to measure the similarity between pairwise graphs error-tolerantly, graph edit distance (GED) is the base of inexact graph matching. The research advance of GED is surveyed in order to provide a review of the existing literatures and offer some insights into the studies of GED. Since graphs may be attributed or non-attributed and the definition of costs for edit operations is various, the existing GED algorithms are categorized according to these two factors and described in detail. After these algorithms are analyzed and their limitations are identified, several promising directions for further research are proposed. © Springer-Verlag London Limited 2009.	en_US
dc.relation.ispartof	Pattern Analysis and Applications	en_US
dc.relation.isbasedon	10.1007/s10044-008-0141-y	en_US
dc.subject.classification	Artificial Intelligence & Image Processing	en_US
dc.title	A survey of graph edit distance	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	13	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	13	en_US

Abstract:

Inexact graph matching has been one of the significant research foci in the area of pattern analysis. As an important way to measure the similarity between pairwise graphs error-tolerantly, graph edit distance (GED) is the base of inexact graph matching. The research advance of GED is surveyed in order to provide a review of the existing literatures and offer some insights into the studies of GED. Since graphs may be attributed or non-attributed and the definition of costs for edit operations is various, the existing GED algorithms are categorized according to these two factors and described in detail. After these algorithms are analyzed and their limitations are identified, several promising directions for further research are proposed. © Springer-Verlag London Limited 2009.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/15103