Results 1 to 10 of about 75,062 (184)

Graph edit distance from spectral seriation [PDF]

open access: yesIEEE Transactions on Pattern Analysis and Machine Intelligence, 2005
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance ...
Hancock, E R, Robles-Kelly, A
core   +8 more sources

Bayesian graph edit distance [PDF]

open access: yesProceedings 10th International Conference on Image Analysis and Processing, 2000
This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1].
Hancock, E.R., Myers, R., Wilson, R.C.
core   +3 more sources

The Edit Distance Function of Some Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2020
The edit distance function of a hereditary property 𝒣 is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and 𝒣. Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj   +3 more sources

Convex Graph Invariant Relaxations For Graph Edit Distance [PDF]

open access: yesMathematical Programming, 2019
The edit distance between two graphs is a widely used measure of similarity that evaluates the smallest number of vertex and edge deletions/insertions required to transform one graph to another.
Candogan, Utkan Onur   +1 more
core   +5 more sources

An edit distance for Reeb graphs [PDF]

open access: yes, 2016
We consider the problem of assessing the similarity of 3D shapes using Reeb graphs from the standpoint of robustness under perturbations. For this purpose, 3D objects are viewed as spaces endowed with real-valued functions, while the similarity ...
Bauer, Ulrich   +2 more
core   +4 more sources

Graph edit distance or graph edit pseudo-distance? [PDF]

open access: yes, 2016
Graph Edit Distance has been intensively used since its appearance in 1983. This distance is very appropriate if we want to compare a pair of attributed graphs from any domain and obtain not only a distance, but also the best correspondence between nodes
A Sanfeliu   +28 more
core   +4 more sources

RetroScore: graph edit distance-guided retrosynthesis for accessibility scoring with route metrics [PDF]

open access: yesJournal of Cheminformatics
Molecular generation is a critical method in drug design, but its practical application is often limited by the difficulty of synthesizing the generated molecules.
Sinuo Gao   +3 more
doaj   +2 more sources

Variant evolution graph: Can we infer how SARS-CoV-2 variants are evolving? [PDF]

open access: yesPLoS ONE
The SARS-CoV-2 virus has undergone extensive mutations over time, resulting in considerable genetic diversity among circulating strains. This diversity directly affects important viral characteristics, such as transmissibility and disease severity ...
Badhan Das, Lenwood S Heath
doaj   +2 more sources

Military realm entity links based on improved editing distances [PDF]

open access: yesZhihui kongzhi yu fangzhen, 2023
In order to accurately link the entity references in the commander’s demand statement to the standardized entity nodes in the knowledge graph, an entity linking method in the military domain based on improved edit distance is proposed. By summarizing the
XIA Xudong, YU Ronghuan
doaj   +1 more source

Learning graph edit distance by graph neural networks [PDF]

open access: yesPattern Recognition, 2021
The emergence of geometric deep learning as a novel framework to deal with graph-based representations has faded away traditional approaches in favor of completely new methodologies. In this paper, we propose a new framework able to combine the advances on deep metric learning with traditional approximations of the graph edit distance.
Riba, Pau   +3 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy