Automatic learning of cost functions for graph edit distance

Information Sciences

Volumn 177, Issue 1, 2007, Pages 239-247

  Neuhaus, Michel ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Edit cost function; Graph edit distance; Graph matching

Indexed keywords

EDIT COST FUNCTION; GRAPH EDIT DISTANCE; GRAPH MATCHING;

CONSTRAINT THEORY; COSTS; GRAPH THEORY; MATHEMATICAL MODELS; PATTERN RECOGNITION;

LEARNING SYSTEMS;

EID: 33749655363     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2006.02.013     Document Type: Article

References (27)

1. Special Section on Graph algorithms and computer vision, IEEE Transactions on Pattern Analysis and Machine Intelligence 23 (10) (2001) 1040-1151.
2. Special Issue on graph based representations, Pattern Recognition Letters 24 (8) (2003) 1033-1122.
3. Special Issue on Graph matching in pattern recognition and computer vision, International Journal of Pattern Recognition and Artificial Intelligence 18 (3) (2004) 261-517.
4. Bunke H., and Allermann G. Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1 (1983) 245-253
5. Bunke H., and Shearer K. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19 3 (1998) 255-259
6. Christmas W.J., Kittler J., and Petrou M. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence 17 8 (1995) 749-764
7. Conte D., Foggia P., Sansone C., and Vento M. Thirty years of graph matching in pattern recognition. International Journal of Pattern Recognition and Artificial Intelligence 18 3 (2004) 265-298
8. Cox T., and Cox M. Multidimensional Scaling (1994), Chapman and Hall
9. Cross A.D.J., and Hancock E.R. Graph matching with a dual-step EM algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 11 (1998) 1236-1253
10. Dempster A.P., Laird N.M., and Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society 39 1 (1977) 1-38
11. Fernandez M.-L., and Valiente G. A graph distance metric combining maximum common subgraph and minimum common supergraph. Pattern Recognition Letters 22 6-7 (2001) 753-758
12. Finch A.M., Wilson R.C., and Hancock E.R. Symbolic graph matching with the EM algorithm. Pattern Recognition 31 11 (1998) 1777-1790
13. Hubert L., and Schultz J. Quadratic assignment as a general data analysis strategy. British Journal of Mathematical and Statistical Psychology 29 (1976) 190-241
14. Luo B., and Hancock E. Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 10 (2001) 1120-1136
15. Maltoni D., Maio D., Jain A.K., and Prabhakar S. Handbook of Fingerprint Recognition (2003), Springer
16. Messmer B.T., and Bunke H. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 5 (1998) 493-504
17. Neuhaus M., and Bunke H. A graph matching based approach to fingerprint classification using directional variance. Proceedings of the 5th International Conference on Audio- and Video-Based Biometric Person Authentication. LNCS vol. 3546 (2005), Springer 191-200
18. Neuhaus M., and Bunke H. Self-organizing maps for learning the edit costs in graph matching. IEEE Transactions on Systems, Man, and Cybernetics (Part B) 35 3 (2005) 503-514
19. Redner R.A., and Walker H.F. Mixture densities, maximum likelihood and the EM algorithm. Society for Industrial and Applied Mathematics (SIAM) Review 26 2 (1984) 195-239
20. Ristad E., and Yianilos P. Learning string edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 20 5 (1998) 522-532
21. Sanfeliu A., and Fu K.S. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man, and Cybernetics (Part B) 13 3 (1983) 353-363
22. Vlassis N., and Likas A. A greedy EM algorithm for Gaussian mixture learning. Neural Processing Letters 15 1 (2002) 77-87
23. Wagner R.A., and Fischer M.J. The string-to-string correction problem. Journal of the Association for Computer Machinery 21 1 (1974) 168-173
24. Wallis W.D., Shoubridge P., Kraetzl M., and Ray D. Graph distances using graph union. Pattern Recognition Letters 22 6 (2001) 701-704
25. C.I. Watson, C.L. Wilson, NIST Special Database 4, Fingerprint Database, March 1992.
26. Wilson R.C., and Hancock E. Structural matching by discrete relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence 19 6 (1997) 634-648
27. Wu C.F.J. On the convergence properties of the EM algorithm. The Annals of Statistics 11 1 (1983) 95-103