Exploration of the labelling space given graph edit distance costs

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

Volumn 6658 LNCS, Issue , 2011, Pages 164-174

  Solé Ribalta, Albert ^a   Serratosa, Francesc ^a  

^a UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

Graph Edit Costs; Graph Edit Distance; Graph Labelling Space

Indexed keywords

ATTRIBUTED GRAPHS; GRAPH EDIT COSTS; GRAPH EDIT DISTANCE; GRAPH LABELLING SPACE; GRAPH LABELLING; MEASURE OF SIMILARITIES;

PATTERN RECOGNITION; COSTS; GRAPHIC METHODS; PATTERN MATCHING;

GRAPH THEORY;

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

References (16)

1. Sanfeliu, A., Fu, K.: A Distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics 13(3), 353-362 (1983) (Pubitemid 13591176)
2. Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters 19 (3-4), 255-259 (1998) (Pubitemid 128383123)
3. Shapiro, L., Haralick, R. M.: A metric for comparing relational descriptions. IEEE Transactions on Pattern Analysis and Machine Intelligence 7, 90-94 (1985)
4. Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vision Comput. 27(7), 950-959 (2009)
5. Neuhaus, M., Bunke, H.: Bridging the Gap Between Graph Edit Distance and Kernel Machines. Ser. in Machine Perception and Art. Intelligence, ISBN 9812708170(2007)
6. Conte, D., Guidobaldi, C., Sansone, C.: A Comparison of Three Maximum Common Subgraph Algorithms on a Large Database of Labeled Graphs. In: Hancock, E., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 130-141. Springer, Heidelberg (2003)
7. Gao, X., Xiao, B., Tao, D., Li, X.: A survey of graph edit distance. Pattern Analysis & Applications 13(1), 113-129 (2010)
8. Neuhaus, M., Bunke, H.: Automatic learning of costs functions for graph edit distance. Information Sciences 177(1), 239-247 (2007) (Pubitemid 44556685)
9. Toselli, A. H., Romero, V., Pastor, M., Vidal, E.: Multimodal interactive transcription of text images. Pattern Recognition 43(5), 1814-1825 (2010)
10. Serratosa, F., Solé-Ribalta, A., Cortés, X.: Automatic Learning of Edit Costs based on Interactive & Adaptive Graph Recognition. In: Jiang, X., Ferrer, M., Torsello, A. (eds.) GbRPR 2011. LNCS, vol. 6658, pp. 152-163. Springer, Heidelberg (2011)
11. Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Transactions on Pattern Analysis and Machine Intelligence 18(4), 377-388 (1996) (Pubitemid 126771701)
12. Wong, A. K. C., et al.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE T. on Pat. An. and Mach. Intell. 7, 599-609 (1985)
13. Rice, S. V., Bunke, H., Nartker, T. A.: Classes of cost functions for string edit distance. Algorithmica 18(2), 271-280 (1997) (Pubitemid 128434446)
14. Bunke, H.: Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. IEEE TPAMI 21(9), 917-922 (1999) (Pubitemid 30532491)
15. Grünbaum, B.: Convex Polytopes, 2nd edn. ISBN 0387404090(2003)
16. Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J. T., Georgiopoulos, M., Anagnostopoulos, G. C., Loog, M. (eds.) S+SSPR 2008. LNCS, vol. 5342, pp. 287-297. Springer, Heidelberg (2008)