Self-organizing maps for learning the edit costs in graph matching

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 35, Issue 3, 2005, Pages 503-514

  Neuhaus, Michel ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Cost learning; Graph edit distance; Graph matching; Self organizing map

Indexed keywords

EDGE DETECTION; GRAPH THEORY; LEARNING SYSTEMS; MATHEMATICAL MODELS; SELF ORGANIZING MAPS;

COST LEARNING; GRAPH EDIT DISTANCE; GRAPH MATCHING;

PATTERN MATCHING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; BIOLOGICAL MODEL; CLUSTER ANALYSIS; COMPARATIVE STUDY; COMPUTER ASSISTED DIAGNOSIS; COMPUTER GRAPHICS; COMPUTER SIMULATION; CYTOLOGY; DIATOM; EVALUATION; IMAGE ENHANCEMENT; IMAGE SUBTRACTION; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; METHODOLOGY; REPRODUCIBILITY; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CLUSTER ANALYSIS; COMPUTER GRAPHICS; COMPUTER SIMULATION; DIATOMS; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; INFORMATION STORAGE AND RETRIEVAL; MODELS, BIOLOGICAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; REPRODUCIBILITY OF RESULTS; SENSITIVITY AND SPECIFICITY; SIGNAL PROCESSING, COMPUTER-ASSISTED; SUBTRACTION TECHNIQUE;

EID: 20444400788     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2005.846635     Document Type: Article

References (38)

1. "Special section on graph algorithms and computer vision," IEEE Trans. Pattern Anal. Machine Intell., vol. 23, no. 10, pp. 1040-1151, Oct. 2001.
2. "Special issue on graph based representations," Pattern Recogn. Lett., vol. 24, no. 8, pp. 1033-1122, 2003.
3. "Special issue on graph matching in pattern recognition and computer vision," Int. J. Pattern Recogn. Art. Intell., to be published.
4. H. Bunke and K. Shearer, "A graph distance metric based on the maximal common subgraph," Pattern Recogn. Lett., vol. 19, no. 3, pp. 255-259, 1998.
5. W. Wallis, P. Shoubridge, M. Kraetzl, and D. Ray, "Graph distances using graph union," Pattern Recogn. Lett., vol. 22, no. 6, pp. 701-704, 2001.
6. M.-L. Fernandez and G. Valiente, "A graph distance metric combining maximum common subgraph and minimum common supergraph," Pattern Recogn. Lett., vol. 22, no. 6-7, pp. 753-758, 2001.
7. A. Sanfeliu and K. Fu, "A distance measure between attributed relational graphs for pattern recognition," IEEE Trans. Syst., Man, Cybern., vol. SMC-13, no. 3, pp. 353-363, 1983.
8. R. Myers, R. Wilson, and E. Hancock, "Bayesian graph edit distance," IEEE Trans. Pattern Anal. Machine Intell., vol. 22, no. 6, pp. 628-635, Jun. 2000.
9. B. Messmer and H. Bunke, "A new algorithm for error-tolerant subgraph isomorphism detection," IEEE Trans. Pattern Anal. Machine Intell., vol. 20, no. 5, pp. 493-504, May 1998.
10. H. Bunke, "Error correcting graph matching: On the influence of the underlying cost function," IEEE Trans. Pattern Anal. Machine Intell., vol. 21, no. 9, pp. 917-911, Sep. 1999.
11. T. Kohonen, Self-Organizing Maps. New York: Springer, 1995.
12. B. McKay, "Practical graph isomorphism," Congressus Numerantium, vol. 30, pp. 45-87, 1981.
13. J. Ullman, "An algorithm for subgraph isomorphism," J. Assoc. Comput. Machinery, vol. 23, pp. 31-42, 1976.
14. J. McGregor, "Backtrack search algorithm and the maximal common subgraph problem," Software - Practice Experience, vol. 12, no. 1, pp. 23-34, 1982.
15. R. Wagner and M. Fischer, "The string-to-string correction problem," J. Assoc. Comput. Machinery, vol. 21, no. 1, pp. 168-173, 1974.
16. W. Christmas, J. Kittler, and M. Petrou, "Structural matching in computer vision using probabilistic relaxation," IEEE Trans. Pattern Anal. Machine Intell., vol. 17, no. 8, pp. 749-764, Aug. 1995.
17. R. Wilson and E. Hancock, "Structural matching by discrete relaxation," IEEE Trans. Pattern Anal. Machine Intell., vol. 19, no. 6, pp. 634-648, Jun. 1997.
18. I. Wang, K.-C. Fan, and J.-T. Horng, "Genetic-based search for error-correcting graph isomorphism," IEEE Trans. Syst., Man, Cybern. B, vol. 27, no. 4, pp. 588-597, Aug. 1997.
19. A. Cross, R. Wilson, and E. Hancock, "Inexact graph matching with genetic search," Pattern Recogn., vol. 30, pp. 953-970, 1997.
20. B. Luo and R. Hancock, "Structural graph matching using the EM algorithm and singular value decomposition," IEEE Trans. Pattern Anal. Machine Intell., vol. 23, no. 10, pp. 1120-1136, Oct. 2001.
21. B. Luo, R. Wilson, and E. Hancock, "Spectral feature vectors for graph clustering," in Structural, Syntactic, and Statistical Pattern Recognition, T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, Eds. New York: Springer, 2002, pp. 83-93. LNCS 2396.
22. S. Kosinov and T. Caelli, "Inexact multisubgraph matching using graph eigenspace and clustering models," in Structural, Syntactic, and Statistical Pattern Recognition, T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, Eds. New York: Springer, 2002, pp. 133-142. LNCS 2396.
23. M. Pelillo, "Matching free trees, maximal cliques and monotone game dynamics," IEEE Trans. Pattern Anal. Machine Intell., vol. 24, no. 11, pp. 1535-1541, Nov. 2002.
24. E. Ristad and P. Yianilos, "Learning string edit distance," IEEE Trans. Pattern Anal. Machine Intell., vol. 20, no. 5, pp. 522-532, May 1998.
25. M. Parizeau, N. Ghazzali, and J.-F. Hébert, "Optimizing the cost matrix for approximate string matching using genetic algorithms," Pattern Recogn., vol. 31, no. 4, pp. 431-440, 1998.
26. R. Ambauen, S. Fischer, and H. Bunke, "Graph edit distance with node splitting and merging and its application to diatom identification," in Proc. 4th Int. Workshop Graph Based Representations Pattern Recogn., 2003, pp. 95-106.
27. S. Günter and H. Bunke, "Self-organizing map for clustering in the graph domain," Pattern Recogn. Lett., vol. 23, no. 4, pp. 405-417, 2002.
28. R. Duda, P. Hart, and D. Stork, Pattern Classification. New York: Wiley-Interscience, 2000.
29. A. Jain and R. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice-Hall, 1988.
30. D. Davies and D. Bouldin, "A cluster separation measure," IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, no. 2, pp. 224-227, Feb. 1979.
31. J. Dunn, "Well-separated clusters and optimal fuzzy partitions," J. Cybern., vol. 4, pp. 95-104, 1974.
32. L. Hubert and J. Schultz, "Quadratic assignment as a general data analysis strategy," Brit. J. Math. Statist. Psychol., vol. 29, pp. 190-241, 1976.
33. L. Goodman and W. Kruskal, Measures of Association for Cross Classification. New York: Springer, 1979.
34. T. Calinski and J. Harabasz, "A dendrite method for cluster analysis," Commun. Statist., vol. 3, no. 1, pp. 1-27, 1974.
35. W. Rand, "Objective criteria for the evaluation of clustering methods," J. Amer. Statist. Assoc., vol. 66, no. 336, pp. 846-850, 1971.
36. E. Fowlkes and C. Mallows, "A method for comparing two hierarchical clusterings," J. Amer. Statist. Assoc., vol. 78, pp. 553-584, 1983.
37. H. du Buf and M. Bayer, Eds., Automatic Diatom Identification. Singapore: World Scientific, 2002.
38. M. Neuhaus and H. Bunke, "Self-organizing graph edit distance," in Proc. Fourth Int. Workshop Graph Based Representations Pattern Recogn., 2003, pp. 83-94.