Auflistung nach Autor/Autorin "Bunke, Horst"
Anzeige der Einträge 21-40 von 55
-
Exact and Inexact Graph Matching: Methodology and Applications.
Riesen, Kaspar; Jiang, X; Bunke, Horst (Springer Verlag, 2010-01-01) -
Fast Suboptimal Algorithms for the Computation of Graph Edit Distance.
Neuhaus, Michel; Riesen, Kaspar; Bunke, Horst (2006-01-01) -
Feature Ranking Algorithms for Improving Classification of Vector Space Embedded Grahps.
Bunke, Horst; Riesen, Kaspar (LNCS, 2009-01-01) -
Generalized Graph Matching for Data Mining and Information Retrieval.
Brügger, A; Bunke, Horst; Riesen, Kaspar (LNCS 5077, 2008-01-01) -
Generalized Median Graph Computation by Means of Graph Embedding in Vector Spaces.
Ferrer, Miguel; Serratosa, Francesco; Riesen, Kaspar; Bunke, Horst (2010-01-01) -
Graph Classification based on Dissimilarity Space Embedding.
Bunke, Horst; Riesen, Kaspar (2008-01-01) -
Graph Classification by means of Lipschitz Embedding.
Riesen, Kaspar; Bunke, Horst (2009-01-01) -
Graph Edit Distance - Optimal and Suboptimal Algorithms with Applications.
Bunke, Horst; Riesen, Kaspar (Wiley-VCH, 2009-01-01) -
Graph Embedding in Vector Spaces by means of Prototype Selection.
Riesen, Kaspar; Neuhaus, Michel; Bunke, Horst (2007-01-01) -
Graph Embedding Using Dissimilarities with Applications in Classification.
Bunke, Horst; Riesen, Kaspar (2013-01-01) -
Graph Similarity Features for HMM-Based Handwriting Recognition in Historical Documents.
Fischer, Andreas; Riesen, Kaspar; Bunke, Horst (2010-01-01) -
IAM Graph Database Repository for Graph based Pattern Recognition and Machine Learning.
Bunke, Horst; Riesen, Kaspar (2008-01-01) -
Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy
Riesen, Kaspar; Bunke, Horst (2014)The authors of the present paper previously introduced a fast approximation framework for the graph edit distance problem. The basic idea of this approximation is to build a square cost matrix C = (c ij ), where each entry ... -
Improving Approximate Graph Edit Distance Using Genetic Algorithms.
Riesen, Kaspar; Fischer, Andreas; Bunke, Horst (2014-08-22) -
Improving bipartite graph edit distance approximation using various search strategies
Riesen, Kaspar; Bunke, Horst (2015-04)Recently the authors of the present paper introduced an approximation framework for the graph edit distance problem. The basic idea of this approximation is to first build a square cost matrix C=(cij)C=(cij), where each ... -
Improving Graph Classification by Isomap.
Riesen, Kaspar; Frinken, Volkmar; Bunke, Horst (LNCS 5534, 2009-01-01) -
Improving Graph Edit Distance Approximation by Centrality Measures.
Riesen, Kaspar; Bunke, Horst (2014-08-28) -
Improving Hausdorff Edit Distance Using Structural Node Context
Fischer, Andreas; Uchida, Seiichi; Frinken, Volkmar; Riesen, Kaspar; Bunke, Horst (Springer, 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 ... -
Iterative Bipartite Graph Edit Distance Approximation.
Riesen, Kaspar; Dornberger, Rolf; Bunke, Horst (2014-04-10) -
Iterative Bipartite Graph Edit Distance Approximation.
Riesen, Kaspar; Dornberger, Rolf; Bunke, Horst (2014)One of the major tasks in many applications in the field of document analysis is the computation of dissimilarities between two or more objects from a given problem domain. Hence, employing graphs as representation formalism ...