Approximate graph edit distance computation by means of bipartite graph matching

作者: Kaspar Riesen , Horst Bunke

DOI: 10.1016/J.IMAVIS.2008.04.004

关键词:

摘要: … tasks in pattern recognition, machine learning, and data mining. … sense that we allow insertions or deletions to occur not only in … Our dataset consists of 20 classes and 30 instances per …

参考文章(34)
Kaspar Riesen, Michel Neuhaus, Horst Bunke, Bipartite graph matching for computing the edit distance of graphs GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition. pp. 1- 12 ,(2007) , 10.1007/978-3-540-72903-7_1
R. Ambauen, S. Fischer, Horst Bunke, Graph edit distance with node splitting and merging, and its application to diatom identification Lecture Notes in Computer Science. pp. 95- 106 ,(2003) , 10.1007/3-540-45028-9_9
Edward Richard Henry, Classification and uses of finger prints ,(1928)
Maria C. Boeres, Celso C. Ribeiro, Isabelle Bloch, A Randomized Heuristic for Scene Recognition by Graph Matching Lecture Notes in Computer Science. pp. 100- 113 ,(2004) , 10.1007/978-3-540-24838-5_8
Michel Neuhaus, Horst Bunke, A graph matching based approach to fingerprint classification using directional variance Lecture Notes in Computer Science. pp. 191- 200 ,(2005) , 10.1007/11527923_20
Philippe Dosch, Ernest Valveny, Report on the Second Symbol Recognition Contest Lecture Notes in Computer Science. ,vol. 3926, pp. 381- 397 ,(2006) , 10.1007/11767978_35
Sébastien Sorlin, Christine Solnon, Reactive Tabu Search for Measuring Graph Similarity Graph-Based Representations in Pattern Recognition. pp. 172- 182 ,(2005) , 10.1007/978-3-540-31988-7_16
Michel Neuhaus, Kaspar Riesen, Horst Bunke, Fast Suboptimal Algorithms for the Computation of Graph Edit Distance Lecture Notes in Computer Science. pp. 163- 172 ,(2006) , 10.1007/11815921_17