Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the graph edit distance cost: Properties and applications

Autor
Solé, A.; Serratosa, F.; Sanfeliu, A.
Tipus d'activitat
Article en revista
Revista
International journal of pattern recognition and artificial intelligence
Data de publicació
2012-08
Volum
26
Número
5
Pàgina inicial
1
Pàgina final
21
DOI
https://doi.org/10.1142/S021800141260004X Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/19734 Obrir en finestra nova
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 de¯ne 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 de¯ning some interesting properties that are useful for a bett...
Citació
Solé, A.; Serratosa, F.; Sanfeliu, A. On the graph edit distance cost: Properties and applications. "International journal of pattern recognition and artificial intelligence", Agost 2012, vol. 26, núm. 5, p. 1-21.
Paraules clau
Graph Edit Costs, Graph Edit Distance, error-correcting graph isomorphism, graph distance, graph similarity
Grup de recerca
VIS - Visió Artificial i Sistemes Intel.ligents

Participants