Learning Edit Cost Estimation Models for Graph Edit Distance

Abstract : One of the most popular distance measures between a pair of graphs is the Graph Edit Distance. This approach consists of finding a set of edit operations that completely transforms a graph into another. Edit costs are introduced in order to penalize the distortion that each edit operation introduces. Then, one basic requirement when we design a Graph Edit Distance algorithm, is to define the appropriate edit cost functions. On the other hand, Machine Learning algorithms has been applied in many contexts showing impressive results, due, among other things, its ability to find correlations between input and output values. The aim of this paper is to bring the potentialities of Machine Learning to the Graph Edit Distance problem presenting a general framework in which this kind of algorithms are used to estimate the edit costs values for node substitutions.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02285793
Contributor : Donatello Conte <>
Submitted on : Friday, September 13, 2019 - 10:02:29 AM
Last modification on : Saturday, September 14, 2019 - 5:58:25 PM

File

2019PRL_Hal.pdf
Files produced by the author(s)

Identifiers

Citation

Xavier Cortés, Donatello Conte, Hubert Cardot. Learning Edit Cost Estimation Models for Graph Edit Distance. Pattern Recognition Letters, Elsevier, 2019, 125, pp.256-263. ⟨10.1016/j.patrec.2019.05.001⟩. ⟨hal-02285793⟩

Share

Metrics

Record views

81

Files downloads

87