Approximation of graph edit distance based on Hausdorff matching
作者：
Highlights：
• Quadratic time approximation of graph edit distance based on Hausdorff matching.
• Error-tolerant graph matching method without constraints on node and edge labels.
• Experimental evaluation for classification of graphs representing letter drawings, fingerprints, and molecules.
• Experimental evaluation for hidden Markov model recognition of vector space embedded graphs representing handwriting.
• Promising potential in terms of flexibility, efficiency, and accuracy.
摘要
Highlights•Quadratic time approximation of graph edit distance based on Hausdorff matching.•Error-tolerant graph matching method without constraints on node and edge labels.•Experimental evaluation for classification of graphs representing letter drawings, fingerprints, and molecules.•Experimental evaluation for hidden Markov model recognition of vector space embedded graphs representing handwriting.•Promising potential in terms of flexibility, efficiency, and accuracy.
论文关键词：Graph edit distance,Hausdorff distance,Approximation algorithms,Graph classification,Graph embedding,Handwriting recognition
论文评审过程：Received 27 September 2013, Revised 8 May 2014, Accepted 21 July 2014, Available online 31 July 2014.
论文官网地址：https://doi.org/10.1016/j.patcog.2014.07.015
