• A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching 

      Ferrer, Miquel; Serratosa, Francesco; Riesen, Kaspar (Springer, 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 ...
    • Approximation of Graph Edit Distance in Quadratic Time 

      Riesen, Kaspar; Ferrer, Miquel; Fischer, Andreas; Bunke, Horst (2015-05)
      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 ...
    • Building Classifier Ensembles Using Greedy Graph Edit Distance 

      Riesen, Kaspar; Ferrer, Miquel; Fischer, Andreas (Springer, 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 ...
    • Suboptimal Graph Edit Distance Based on Sorted Local Assignments 

      Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst (Springer, 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 ...