Articles producció científica> Enginyeria Informàtica i Matemàtiques

ON THE GRAPH EDIT DISTANCE COST: PROPERTIES AND APPLICATIONS

  • Dades identificatives

    Identificador: imarina:9245873
    Autors:
    Sole-Ribalta, AlbertSerratosa, FrancescSanfeliu, Alberto
    Resum:
    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.
  • Altres:

    Autor segons l'article: Sole-Ribalta, Albert; Serratosa, Francesc; Sanfeliu, Alberto
    Departament: Enginyeria Informàtica i Matemàtiques
    Autor/s de la URV: Serratosa Casanelles, Francesc d'Assís / Solé Ribalta, Albert
    Paraules clau: Sets Recognition Graph similarity Graph edit distance Graph edit costs Graph distance Error-correcting graph isomorphism Computation Algorithm
    Resum: 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.
    Àrees temàtiques: Software Engenharias iv Educação Computer vision and pattern recognition Computer science, artificial intelligence Ciência da computação Astronomia / física Artificial intelligence
    Accès a la llicència d'ús: https://creativecommons.org/licenses/by/3.0/es/
    Adreça de correu electrònic de l'autor: albert.sole@urv.cat francesc.serratosa@urv.cat
    Identificador de l'autor: 0000-0002-2953-5338 0000-0001-6112-5913
    Data d'alta del registre: 2024-10-12
    Versió de l'article dipositat: info:eu-repo/semantics/acceptedVersion
    Enllaç font original: https://www.worldscientific.com/doi/abs/10.1142/S021800141260004X
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referència a l'article segons font original: International Journal Of Pattern Recognition And Artificial Intelligence. 26 (5): 1260004-
    Referència de l'ítem segons les normes 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
    DOI de l'article: 10.1142/S021800141260004X
    Entitat: Universitat Rovira i Virgili
    Any de publicació de la revista: 2012
    Tipus de publicació: Journal Publications
  • Paraules clau:

    Artificial Intelligence,Computer Science, Artificial Intelligence,Computer Vision and Pattern Recognition,Software
    Sets
    Recognition
    Graph similarity
    Graph edit distance
    Graph edit costs
    Graph distance
    Error-correcting graph isomorphism
    Computation
    Algorithm
    Software
    Engenharias iv
    Educação
    Computer vision and pattern recognition
    Computer science, artificial intelligence
    Ciência da computação
    Astronomia / física
    Artificial intelligence
  • Documents:

  • Cerca a google

    Search to google scholar