On the relevance of local neighbourhoods for greedy graph edit distance
X Cortés, F Serratosa, K Riesen - Structural, Syntactic, and Statistical …, 2016 - Springer
Approximation of graph edit distance based on bipartite graph matching emerged to an
important model for distance based graph classification. However, one of the drawbacks of …
important model for distance based graph classification. However, one of the drawbacks of …
An edit distance between graph correspondences
Abstract The Hamming Distance has been largely used to calculate the dissimilarity of a pair
of correspondences (also known as labellings or matchings) between two structures (ie sets …
of correspondences (also known as labellings or matchings) between two structures (ie sets …
Learning the Consensus of Multiple Correspondences Between Data Structures
CF Moreno García - 2016 - tdx.cat
In this work, we present a framework to learn the consensus given multiple
correspondences. It is assumed that the several parties involved have generated separately …
correspondences. It is assumed that the several parties involved have generated separately …
An edit distance between graph correspondences.
F Serratosa, X Jiang - 2017 - rgu-repository.worktribe.com
The Hamming Distance has been largely used to calculate the dissimilarity of a pair of
correspondences (also known as labellings or matchings) between two structures (ie sets of …
correspondences (also known as labellings or matchings) between two structures (ie sets of …
[引用][C] LEARNING THE CONSENSUS OF MULTIPLE CORRESPONDENCES BETWEEN DATA STRUCTURES
FS Casanelles