Automatic learning of edit costs based on interactive and adaptive graph recognition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6658 LNCS, Issue , 2011, Pages 152-163

  Serratosa, Francesc ^a   Solé Ribalta, Albert ^a   Cortés, Xavier ^a  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Adaptive Learning; Graph Edit Distance; Interactive Learning

Indexed keywords

ADAPTIVE LEARNING; AUTOMATIC-LEARNING; COST VALUES; ERROR-TOLERANT GRAPH MATCHING; GRAPH EDIT DISTANCE; HUMAN INTERACTIONS; INPUT GRAPHS; INTERACTIVE LEARNING; RECOGNITION METHODS; RECOGNITION RATIO; TRIAL-AND-ERROR METHOD;

PATTERN RECOGNITION; USER INTERFACES; COSTS; GRAPHIC METHODS; PATTERN MATCHING;

COSTS; PATTERN RECOGNITION;

EID: 79956295194     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-20844-7_16     Document Type: Article

References (16)

1. Caetano, T. S., McAuley, J. J., Cheng, L., Le, Q. V., Smola, A. J.: Learning Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048-1058 (2009)
2. Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. on Sys., Man and Cybern. 13, 353-362 (1983) (Pubitemid 13591176)
3. Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1(4), 245-253 (1983)
4. Neuhaus, M., Bunke, H.: A Probabilistic Approach to Learning Costs for Graph Edit Distance. ICPR (3), 389-393 (2004)
5. Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. on Sys., Man, and Cybernetics, Part B 35(3), 503-514 (2005) (Pubitemid 40794861)
6. Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci. 177(1), 239-247 (2007) (Pubitemid 44556685)
7. Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18(8), 689-694 (1997) (Pubitemid 127411238)
8. Lladós, J., Martí, E., Villanueva, J. J.: Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1137-1143 (2001) (Pubitemid 33047951)
9. Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE TPAMI 18(4), 377-388 (1996) (Pubitemid 126771701)
10. Christmas, W. J., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE TPAMI 17(8), 749-764 (1995)
11. Duda, R. O., Hart, P. E.: Pattern Classification and Scene Analysis. J. Wiley, Chichester (1973)
12. Canny, J.: The future of human-computer interaction. Queue, ACM 4(6), 24-32 (2006)
13. Vidal, E., Rodríguez, L., Casacuberta, F., García-Varea, I.: Interactive Pattern Recognition. In: MLMI, pp. 60-71 (2007) (Pubitemid 351333591)
14. Toselli, A. H., Romero, V., Pastor, M., Vidal, E.: Multimodal interactive transcription of text images. Pattern Recognition 43(5), 1814-1825 (2010)
15. Casacuberta, F., Civera, J., Cubel, E., Lagarda, A. L., Lapalme, G., Macklovitch, E., Vidal, E.: Human interaction for high-quality machine translation. Commun. ACM 52(10), 135-138 (2009)
16. http://deim.urv. cat/~francesc.serratosa/Tarragona-Graph-Data base