An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems

Zeina Abu-Aisheh, Romain Raveaux, Jean-Yves Ramel, Patrick Martineau

2015

Abstract

Graph edit distance is an error tolerant matching technique emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning and data mining; it represents the minimum-cost sequence of basic edit operations to transform one graph into another by means of insertion, deletion and substitution of vertices and/or edges. A widely used method for exact graph edit distance computation is based on the A* algorithm. To overcome its high memory load while traversing the search tree for storing pending solutions to be explored, we propose a depth-first graph edit distance algorithm which requires less memory and searching time. An evaluation of all possible solutions is performed without explicitly enumerating them all. Candidates are discarded using an upper and lower bounds strategy. A solid experimental study is proposed; experiments on a publicly available database empirically demonstrated that our approach is better than the A* graph edit distance computation in terms of speed, accuracy and classification rate.

References

  1. Andreas Fischer, Ching Y. Suen, V. F. K. R. H. B. (2013). A fast matching algorithm for graph-based handwriting recognition. GbRPR 2013, 7877:194-203.
  2. Andrew D. J. Cross, E. R. H. (1998). Graph matching with a dual-step em algorithm. IEEE Trans. Pattern Anal. Mach. Intell., 20(11):1236-1253.
  3. Christmas, W., Kittler, J., and Petrou, M. (1995). Structural matching in computer vision using probabilistic relaxation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 17(8):749-764.
  4. Cross, A. D., Wilson, R. C., and Hancock, E. R. (1997). Inexact graph matching using genetic search. Pattern Recognition, 30(6):953-970.
  5. Dosch, P. and Valveny, E. (2006). Report on the second symbol recognition contest. 3926:381-397.
  6. Fankhauser, S., Riesen, K., Bunke, H., and Dickinson, P. J. (2012). Suboptimal graph isomorphism using bipartite matching. IJPRAI, 26(6).
  7. Finch, A., Wilson, R., and Hancock, E. (1998). An energy function and continuous edit process for graph matching. Neural Computation, 10(7):1873-1894.
  8. Justice, D. and Hero, A. (2006). A binary linear programming formulation of the graph edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(8):1200-1214.
  9. Kuner, P. and Ueberreiter, B. (1988). Pattern recognition by graph matching: Combinatorial versus continuous optimization. International Journal in Pattern Recognition and Artificial Intelligence, 2(3):527-542.
  10. M. Neuhaus, K. R. and Bunke., H. (2006). Fast suboptimal algorithms for the computation of graph edit distance. Proceedings of 11th International Workshop on Structural and Syntactic Pattern Recognition., 28:163-172.
  11. Riesen, K. and Bunke, H. (2008). Iam graph database repository for graph based pattern recognition and machine learning. pages 287-297.
  12. Riesen, K. and Bunke, H. (2009). Approximate graph edit distance computation by means of bipartite graph matching. Image and Vision Computing, 27(7):950- 959.
  13. Riesen, K. and Bunke, H. (2010). Graph Classification and Clustering Based on Vector Space Embedding.
  14. Riesen, K., Fankhauser, S., and Bunke, H. (2007). Speeding up graph edit distance computation with a bipartite heuristic. In Mining and Learning with Graphs, MLG 2007, Proceedings.
  15. Sanfeliu, A. and Fu, K. (1983). A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics, 13(3):353-362.
  16. Tsai, W.-H. and Fu, K.-S. (1979). Error-correcting isomorphisms of attributed relational graphs for pattern analysis. Systems, Man and Cybernetics, IEEE Transactions on, 9(12):757-768.
  17. Tsai, W.-H. and Fu, K.-S. (1983). Subgraph error-correcting isomorphisms for syntactic pattern recognition. Systems, Man and Cybernetics, IEEE Transactions on, SMC-13(1):48-62.
  18. Vento, M. (2015). A long trip in the charming world of graphs for pattern recognition. Pattern Recognition, 48(2):291-301.
  19. Zeng, Z., Tung, A. K. H., Wang, J., Feng, J., and Zhou, L. (2009). Comparing stars: On approximating graph edit distance. Proc. VLDB Endow., 2(1):25-36.
Download


Paper Citation


in Harvard Style

Abu-Aisheh Z., Raveaux R., Ramel J. and Martineau P. (2015). An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems . In Proceedings of the International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM, ISBN 978-989-758-076-5, pages 271-278. DOI: 10.5220/0005209202710278


in Bibtex Style

@conference{icpram15,
author={Zeina Abu-Aisheh and Romain Raveaux and Jean-Yves Ramel and Patrick Martineau},
title={An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems},
booktitle={Proceedings of the International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,},
year={2015},
pages={271-278},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005209202710278},
isbn={978-989-758-076-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Pattern Recognition Applications and Methods - Volume 1: ICPRAM,
TI - An Exact Graph Edit Distance Algorithm for Solving Pattern Recognition Problems
SN - 978-989-758-076-5
AU - Abu-Aisheh Z.
AU - Raveaux R.
AU - Ramel J.
AU - Martineau P.
PY - 2015
SP - 271
EP - 278
DO - 10.5220/0005209202710278