Suche
Anzeige der Einträge 1-4 von 4
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching
(Springer, 2015)
Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015.
In recent years, a powerful approximation framework for graph edit distance computation has been introduced. This particular approximation is based on an optimal assignment of local graph structures which can be established ...
04B - Beitrag Konferenzschrift
Suboptimal Graph Edit Distance Based on Sorted Local Assignments
(Springer, 2015)
Multiple Classifier Systems - 12th International Workshop, MCS 2015, Günzburg, Germany, June 29 - July 1, 2015
Graph based pattern representation offers a number of useful properties. In particular, graphs can adapt their size and complexity to the actual pattern, and moreover, graphs are able to describe structural relations that ...
04B - Beitrag Konferenzschrift
Approximation of Graph Edit Distance in Quadratic Time
(2015-05)
Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015.
The basic idea of a recent graph matching framework is to reduce the problem of graph edit distance (GED) to an instance of a linear sum assignment problem (LSAP). The optimal solution for this simplified GED problem can ...
04B - Beitrag Konferenzschrift
Building Classifier Ensembles Using Greedy Graph Edit Distance
(Springer, 2015)
Multiple Classifier Systems - 12th International Workshop, MCS 2015, Günzburg, Germany, June 29 - July 1, 2015
Classifier ensembles aim at more accurate classifications than single classifiers. In the present paper we introduce a general approach to building structural classifier ensembles, i.e. classifiers that make use of graphs ...
04B - Beitrag Konferenzschrift