Results 151 to 160 of about 75,062 (184)
Some of the next articles are maybe not open access.
Self-Organizing Graph Edit Distance
2003This paper addresses the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps representing attribute distance spaces that encode edit operation costs.
Michel Neuhaus, Horst Bunke
openaire +1 more source
2015
In this chapter, we reformulate the graph edit distance problem to a quadratic assignment problem. This reformulation actually builds the basis for a recent approximation algorithm, which in turn builds the core algorithm for the second part of the present book.
openaire +1 more source
In this chapter, we reformulate the graph edit distance problem to a quadratic assignment problem. This reformulation actually builds the basis for a recent approximation algorithm, which in turn builds the core algorithm for the second part of the present book.
openaire +1 more source
Bipartite Graph Matching for Computing the Edit Distance of Graphs
2007In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to describe relational information in the patterns under consideration. One of the main drawbacks of graph representations is that the computation of standard graph similarity ...
Riesen, Kaspar +2 more
openaire +1 more source
Learning Exact Graph Edit Distance
2015In the previous chapter, two different strategies have been proposed for improving the general distance quality of the approximation framework BP-GED. In the present chapter, two additional approaches are pursued for reducing the approximation error. First, in Sect.
openaire +1 more source
A comparative analysis of new graph distance measures and graph edit distance
Information Sciences, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Tao +3 more
openaire +1 more source
Fast Similarity Search for Graphs by Edit Distance
Cybernetics and Systems Analysis, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Graph-Graph Context Dependency Attention for Graph Edit Distance
ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2023Ruiqi Jia +3 more
openaire +1 more source
Speeding Up Bipartite Graph Edit Distance
2015Major goal of the present chapter is to introduce methods for speeding up the approximation framework BP-GED. In particular, we aim at substantially speeding up the second step of BP-GED, viz., the assignment of local substructures in the LSAP. In BP-GED a state-of-the-art algorithm with cubic time complexity is employed in order to optimally solve the
openaire +1 more source