Auflistung Hochschule für Wirtschaft nach Autor/Autorin "Fischer, Andreas"
Anzeige der Einträge 1-11 von 11
-
A Fast Matching Algorithm for Graph-Based Handwriting Recognition
(2013)Graph-Based Representations in Pattern Recognition04B - Beitrag Konferenzschrift -
An Experimental Study of Graph Classification using Prototype Selection
(2008)Proc. 19th Int. Conf. on Pattern Recognition, IEEE04B - Beitrag Konferenzschrift -
Approximation of graph edit distance based on Hausdorff matching
(2015)Pattern Recognition01A - Beitrag in wissenschaftlicher Zeitschrift -
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
(2015)Multiple Classifier Systems - 12th International Workshop, MCS 2015, Günzburg, Germany, June 29 - July 1, 2015Classifier 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 -
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation
(2014)Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014, ProceedingsGraph edit distance (GED) is a powerful and flexible graph dissimilarity model. Yet, exact computation of GED is an instance of a quadratic assignment problem and can thus be solved in exponential time complexity only. A ...04B - Beitrag Konferenzschrift -
Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time
(2014)Artificial Neural Networks in Pattern Recognition - 6th IAPR TC 3 International Workshop, ANNPR 2014, Montreal, QC, Canada, October 6-8, 2014. ProceedingsExact computation of graph edit distance (GED) can be solved in exponential time complexity only. A previously introduced approximation framework reduces the computation of GED to an instance of a linear sum assignment ...04B - Beitrag Konferenzschrift -
Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations
(2015-03-02)International Journal of Pattern Recognition and Artificial IntelligenceThe concept of graph edit distance (GED) is still one of the most flexible and powerful graph matching approaches available. Yet, exact computation of GED can be solved in exponential time complexity only. A previously ...01 - Zeitschriftenartikel, Journalartikel oder Magazin -
Graph Similarity Features for HMM-Based Handwriting Recognition in Historical Documents
(2010)Proceedings of the International Conference on Frontiers in Handwriting Recognition04B - Beitrag Konferenzschrift -
Improving Approximate Graph Edit Distance Using Genetic Algorithms
(2014-08-22)04B - Beitrag Konferenzschrift -
Improving Hausdorff Edit Distance Using Structural Node Context
(2015)Graph-Based Representations in Pattern Recognition - 10th IAPR-TC-15 International Workshop, GbRPR 2015, Beijing, China, May 13-15, 2015.In order to cope with the exponential time complexity of graph edit distance, several polynomial-time approximation algorithms have been proposed in recent years. The Hausdorff edit distance is a quadratic-time matching ...04B - Beitrag Konferenzschrift