A survey of graph edit distance
Gao, X. and Xiao, B. and Tao, D. and Li, Xuelong (2010) A survey of graph edit distance. Pattern Analysis and Applications 13 (1), pp. 113-129. ISSN 1433-7541.
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.
Metadata
| Item Type: | Article |
|---|---|
| School: | School of Business, Economics & Informatics > Computer Science and Information Systems |
| Depositing User: | Administrator |
| Date Deposited: | 07 Feb 2011 13:48 |
| Last Modified: | 11 Oct 2016 15:27 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/1852 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |