Author, as appears in the article.: Sole-Ribalta, Albert; Serratosa, Francesc; Sanfeliu, Alberto
Department: Enginyeria Informàtica i Matemàtiques
URV's Author/s: Serratosa Casanelles, Francesc d'Assís / Solé Ribalta, Albert
Keywords: Sets Recognition Graph similarity Graph edit distance Graph edit costs Graph distance Error-correcting graph isomorphism Computation Algorithm
Abstract: We model the edit distance as a function in a labeling space. A labeling space is an Euclidean space where coordinates are the edit costs. Through this model, we define a class of cost. A class of cost is a region in the labeling space that all the edit costs have the same optimal labeling. Moreover, we characterize the distance value through the labeling space. This new point of view of the edit distance gives us the opportunity of defining some interesting properties that are useful for a better understanding of the edit distance. Finally, we show the usefulness of these properties through some applications.
Thematic Areas: Software Engenharias iv Educação Computer vision and pattern recognition Computer science, artificial intelligence Ciência da computação Astronomia / física Artificial intelligence
licence for use: https://creativecommons.org/licenses/by/3.0/es/
Author's mail: albert.sole@urv.cat francesc.serratosa@urv.cat
Author identifier: 0000-0002-2953-5338 0000-0001-6112-5913
Record's date: 2024-10-12
Papper version: info:eu-repo/semantics/acceptedVersion
Licence document URL: https://repositori.urv.cat/ca/proteccio-de-dades/
Papper original source: International Journal Of Pattern Recognition And Artificial Intelligence. 26 (5): 1260004-
APA: Sole-Ribalta, Albert; Serratosa, Francesc; Sanfeliu, Alberto (2012). ON THE GRAPH EDIT DISTANCE COST: PROPERTIES AND APPLICATIONS. International Journal Of Pattern Recognition And Artificial Intelligence, 26(5), 1260004-. DOI: 10.1142/S021800141260004X
Entity: Universitat Rovira i Virgili
Journal publication year: 2012
Publication Type: Journal Publications
Repositori URV