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

Redefining the Graph Edit Distance

  • Dades identificatives

    Identificador: imarina:9230881
    Autors:
    Serratosa, Francesc
    Resum:
    Graph edit distance has been used since 1983 to compare objects in machine learning when these objects are represented by attributed graphs instead of vectors. In these cases, the graph edit distance is usually applied to deduce a distance between attributed graphs. This distance is defined as the minimum amount of edit operations (deletion, insertion and substitution of nodes and edges) needed to transform a graph into another. Since now, it has been stated that the distance properties have to be applied [(1) non-negativity (2) symmetry (3) identity and (4) triangle inequality] to the involved edit operations in the process of computing the graph edit distance to make the graph edit distance a metric. In this paper, we show that there is no need to impose the triangle inequality in each edit operation. This is an important finding since in pattern recognition applications, the classification ratio usually maximizes in the edit operation combinations (deletion, insertion and substitution of nodes and edges) that the triangle inequality is not fulfilled.
  • Altres:

    Autor segons l'article: Serratosa, Francesc
    Departament: Enginyeria Informàtica i Matemàtiques
    Autor/s de la URV: Serratosa Casanelles, Francesc d'Assís
    Paraules clau: Learning Graph edit distance Distance definition Attributed graphs
    Resum: Graph edit distance has been used since 1983 to compare objects in machine learning when these objects are represented by attributed graphs instead of vectors. In these cases, the graph edit distance is usually applied to deduce a distance between attributed graphs. This distance is defined as the minimum amount of edit operations (deletion, insertion and substitution of nodes and edges) needed to transform a graph into another. Since now, it has been stated that the distance properties have to be applied [(1) non-negativity (2) symmetry (3) identity and (4) triangle inequality] to the involved edit operations in the process of computing the graph edit distance to make the graph edit distance a metric. In this paper, we show that there is no need to impose the triangle inequality in each edit operation. This is an important finding since in pattern recognition applications, the classification ratio usually maximizes in the edit operation combinations (deletion, insertion and substitution of nodes and edges) that the triangle inequality is not fulfilled.
    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: francesc.serratosa@urv.cat
    Identificador de l'autor: 0000-0001-6112-5913
    Data d'alta del registre: 2024-10-12
    Versió de l'article dipositat: info:eu-repo/semantics/publishedVersion
    Enllaç font original: https://link.springer.com/article/10.1007/s42979-021-00792-5
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referència a l'article segons font original: Sn Computer Science. 2 (6): Article numbre 438-
    Referència de l'ítem segons les normes APA: Serratosa, Francesc (2021). Redefining the Graph Edit Distance. Sn Computer Science, 2(6), Article numbre 438-. DOI: 10.1007/s42979-021-00792-5
    DOI de l'article: 10.1007/s42979-021-00792-5
    Entitat: Universitat Rovira i Virgili
    Any de publicació de la revista: 2021
    Tipus de publicació: Journal Publications
  • Paraules clau:

    Learning
    Graph edit distance
    Distance definition
    Attributed graphs
  • Documents:

  • Cerca a google

    Search to google scholar