TY - CHAP
AB - The authors of the present paper previously introduced a fast approximation framework for the graph edit distance problem. The basic idea of this approximation is to build a square cost matrix Cā=ā(c ij ), where each entry c ij reflects the cost of a node substitution, deletion or insertion plus the matching cost arising from the local edge structure. Based on C an optimal assignment of the nodes and their local structure is established in polynomial time. Yet, this procedure considers the graph structure only in a local way, and thus, an overestimation of the true graph edit distance has to be accepted. The present paper aims at reducing this overestimation by means of an additional greedy search strategy that builds upon the initial assignment. In an experimental evaluation on three real world data sets we empirically verify a substantial gain of distance accuracy while run time is nearly not affected.
M3 - 04 - Beitrag Sammelband oder Konferenzschrift
PY - 2014
DO - http://hdl.handle.net/11654/8225
A1 - Riesen, Kaspar
A1 - Bunke, Horst
LA - en
CY - Stockholm
SN - 978-1-4799-5208-3
T1 - Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy
SP - 314-321
UR - http://hdl.handle.net/11654/8225
T2 - 22nd International Conference on Pattern Recognition, ICPR 2014, Stockholm, Sweden, August 24-28, 2014
ER -