{"id":1066,"date":"2022-10-23T06:07:58","date_gmt":"2022-10-23T06:07:58","guid":{"rendered":"https:\/\/prg.inf.unibe.ch\/?page_id=1066"},"modified":"2022-10-23T20:35:28","modified_gmt":"2022-10-23T20:35:28","slug":"publications","status":"publish","type":"page","link":"https:\/\/prg.inf.unibe.ch\/index.php\/publications\/","title":{"rendered":"Publications_23102022"},"content":{"rendered":"\n<p><\/p>\n\n\n\n<div style=\"height:150px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n\n<section class=\"wp-block-uagb-columns uagb-columns__wrap uagb-columns__background-none uagb-columns__stack-mobile uagb-columns__valign- uagb-columns__gap-10 align uagb-block-258d8aca uagb-columns__columns-1 uagb-columns__max_width-theme\"><div class=\"uagb-columns__overlay\"><\/div><div class=\"uagb-columns__inner-wrap uagb-columns__columns-1\">\n<div class=\"wp-block-uagb-column uagb-column__wrap uagb-column__background-undefined uagb-block-2490518c\"><div class=\"uagb-column__overlay\"><\/div>\n<h1 class=\"wp-block-heading\">Publications<\/h1>\n\n\n\n<h2 class=\"wp-block-heading\">Journal papers<\/h2>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2022<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Mathias Fuchs, Kaspar Riesen: A novel way to formalize stable graph cores by using matching-graphs. Pattern Recognit. 131: 108846 (2022)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2020<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Filters for graph-based keyword spotting in historical handwritten documents. Pattern Recognit. Lett. 134: 125-134 (2020)<\/li><li>Kaspar Riesen, Miquel Ferrer, Horst Bunke: Approximate Graph Edit Distance in Quadratic Time. IEEE ACM Trans. Comput. Biol. Bioinform. 17(2): 483-494 (2020)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2019<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Narayan Sch\u00fctz, Alexander B. Leichtle, Kaspar Riesen: A comparative study of pattern recognition algorithms for predicting the inpatient mortality risk using routine laboratory measurements. Artif. Intell. Rev. 52(4): 2559-2573 (2019)<\/li><li>Kaspar Riesen, Roman Schmidt: Online signature verification based on string edit distance. Int. J. Document Anal. Recognit. 22(1): 41-54 (2019)<\/li><li>Mohammad Reza Ameri, Michael Stauffer, Kaspar Riesen, Tien D. Bui, Andreas Fischer: Graph-based keyword spotting in historical manuscripts using Hausdorff edit distance. Pattern Recognit. Lett. 121: 61-67 (2019)<\/li><li>Paul Maergner, Vinaychandran Pondenkandath, Michele Alberti, Marcus Liwicki, Kaspar Riesen, Rolf Ingold, Andreas Fischer: Combining graph edit distance and triplet networks for offline signature verification. Pattern Recognit. Lett. 125: 527-533 (2019)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2018<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Andreas Fischer, Horst Bunke: On the Impact of Using Utilities Rather than Costs for Graph Matching. Neural Process. Lett. 48(2): 691-707 (2018)<\/li><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Keyword spotting in historical handwritten documents based on graph matching. Pattern Recognit. 81: 240-253 (2018)<\/li><li>Kaspar Riesen, Thomas Hanne, Roman Schmidt: Sketch-Based User Authentication With a Novel String Edit Distance Model. IEEE Trans. Syst. Man Cybern. Syst. 48(3): 460-472 (2018)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2017<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Brian Kenji Iwana, Volkmar Frinken, Kaspar Riesen, Seiichi Uchida: Efficient temporal pattern recognition by means of dissimilarity space embedding with discriminative prototypes. Pattern Recognit. 64: 268-276 (2017)<\/li><li>Andreas Fischer, Kaspar Riesen, Horst Bunke: Improved quadratic time approximation of graph edit distance by combining Hausdorff matching and greedy assignment. Pattern Recognit. Lett. 87: 55-62 (2017)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2016<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Miquel Ferrer: Predicting the correctness of node assignments in bipartite graph matching. Pattern Recognit. Lett. 69: 8-14 (2016)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2015<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Andreas Fischer, Horst Bunke: Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations. Int. J. Pattern Recognit. Artif. Intell. 29(2): 1550011:1-1550011:27 (2015)<\/li><li>Andreas Fischer, Ching Y. Suen, Volkmar Frinken, Kaspar Riesen, Horst Bunke: Approximation of graph edit distance based on Hausdorff matching. Pattern Recognit. 48(2): 331-343 (2015)<\/li><li>Kaspar Riesen, Horst Bunke: Improving bipartite graph edit distance approximation using various search strategies. Pattern Recognit. 48(4): 1349-1363 (2015)<\/li><li>Miquel Ferrer, Francesc Serratosa, Kaspar Riesen: Improving bipartite graph matching by assessing the assignment confidence. Pattern Recognit. Lett. 65: 29-36 (2015)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2013<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Ehsan Zare Borzeshi, Massimo Piccardi, Kaspar Riesen, Horst Bunke: Discriminative prototype selection methods for graph embedding. Pattern Recognit. 46(6): 1648-1657 (2013)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2012<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Stefan Fankhauser, Kaspar Riesen, Horst Bunke, Peter J. Dickinson: Suboptimal Graph Isomorphism using bipartite Matching. Int. J. Pattern Recognit. Artif. Intell. 26(6) (2012)<\/li><li>Horst Bunke, Kaspar Riesen: Towards the unification of structural and statistical pattern recognition. Pattern Recognit. Lett. 33(7): 811-825 (2012)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2011<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Horst Bunke, Kaspar Riesen: Recent advances in graph-based pattern recognition with applications in document analysis. Pattern Recognit. 44(5): 1057-1067 (2011)<\/li><li>Horst Bunke, Kaspar Riesen: Improving vector space embedding of graphs through feature selection algorithms. Pattern Recognit. 44(9): 1928-1940 (2011)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2010<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Miquel Ferrer, Ernest Valveny, Francesc Serratosa, Kaspar Riesen, Horst Bunke: Generalized median graph computation by means of graph embedding in vector spaces. Pattern Recognit. 43(4): 1642-1655 (2010)<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2009<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Horst Bunke: Reducing the dimensionality of dissimilarity space embedding graph kernels. Eng. Appl. Artif. Intell. 22(1): 48-56 (2009)<\/li><li>Kaspar Riesen, Horst Bunke: Graph Classification Based on Vector Space Embedding. Int. J. Pattern Recognit. Artif. Intell. 23(6): 1053-1081 (2009)<\/li><li>Kaspar Riesen, Horst Bunke: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(7): 950-959 (2009)<\/li><li>Kaspar Riesen, Horst Bunke: Graph Classification by Means of Lipschitz Embedding. IEEE Trans. Syst. Man Cybern. Part B 39(6): 1472-1483 (2009)<\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Conference papers<\/h2>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2022<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Anthony Gillioz, Kaspar Riesen: Speeding up Graph Matching by Means of Systematic Graph Reductions Using Centrality Measures. ICPRS 2022<\/li><li>Mathias Fuchs, Kaspar Riesen: Augment Small Training Sets Using Matching-Graphs. ICPRAI (2) 2022: 343-354<\/li><li>Anthony Gillioz, Kaspar Riesen: Improving Graph Classification by Means of Linear Combinations of Reduced Graphs. ICPRAM 2022: 17-23<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2021<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Mathias Fuchs, Kaspar Riesen: Iterative Creation of Matching-Graphs &#8211; Finding Relevant Substructures in Graph Sets. CIARP 2021: 382-391<\/li><li>Hans Friedrich Witschel, Kaspar Riesen, Loris Grether: Natural Language-based User Guidance for Knowledge Graph Exploration: A User Study. KDIR 2021: 95-102<\/li><li>Mathias Fuchs, Kaspar Riesen: Graph Embedding in Vector Spaces Using Matching-Graphs. SISAP 2021: 352-363<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2020<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Hans Friedrich Witschel, Kaspar Riesen, Loris Grether KvGR: A Graph-Based Interface for Explorative Sequential Question Answering on Heterogeneous Information Sources. ECIR (1) 2020: 760-773<\/li><li>Mathias Fuchs, Kaspar Riesen: Matching of Matching-Graphs &#8211; A Novel Approach for Graph Classification. ICPR 2020: 6570-6576<\/li><li>Kaspar Riesen, Hans Friedrich Witschel, Loris Grether: A Novel Data Set for Information Retrieval on the Basis of Subgraph Matching. S+SSPR 2020: 205-215<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2019<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Michael Stauffer, Paul Maergner, Andreas Fischer, Kaspar Riesen: Cross-Evaluation of Graph-Based Keyword Spotting in Handwritten Historical Documents. GbRPR 2019: 45-55<\/li><li>Michael Stauffer, Paul Maergner, Andreas Fischer, Kaspar Riesen: Graph Embedding for Offline Handwritten Signature Verification. ICBEA 2019: 69-76<\/li><li>Michael Stauffer, Paul Maergner, Andreas Fischer, Rolf Ingold, Kaspar Riesen: Offline Signature Verification using Structural Dynamic Time Warping. ICDAR 2019: 1117-1124<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2018<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Graph-Based Keyword Spotting in Historical Documents Using Context-Aware Hausdorff Edit Distance. DAS 2018: 49-54<\/li><li>Paul Maergner, Nicholas R. Howe, Kaspar Riesen, Rolf Ingold, Andreas Fischer: Offline Signature Verification Via Structural Methods: Graph Edit Distance and Inkball Models. ICFHR 2018: 163-168<\/li><li>Paul Maergner, Vinaychandran Pondenkandath, Michele Alberti, Marcus Liwicki, Kaspar Riesen, Rolf Ingold, Andreas Fischer: Offline Signature Verification by Combining Graph Edit Distance and Triplet Networks. S+SSPR 2018: 470-480<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2017<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Speeding-Up Graph-Based Keyword Spotting by Quadtree Segmentations. CAIP (1) 2017: 304-315<\/li><li>Kaspar Riesen, Andreas Fischer, Horst Bunke: Improved Graph Edit Distance Approximation with Simulated Annealing. GbRPR 2017: 222-231<\/li><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Speeding-Up Graph-Based Keyword Spotting in Historical Handwritten Documents. GbRPR 2017: 83-93<\/li><li>Michael Stauffer, Thomas Tschachtli, Andreas Fischer, Kaspar Riesen: A Survey on Applications of Bipartite Graph Edit Distance. GbRPR 2017: 242-252<\/li><li>Paul Maergner, Kaspar Riesen, Rolf Ingold, Andreas Fischer: A Structural Approach to Offline Signature Verification Using Graph Edit Distance. ICDAR 2017: 1216-1222<\/li><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Ensembles for Graph-Based Keyword Spotting in Historical Handwritten Documents. ICDAR 2017: 714-720<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2016<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Andreas Fischer, Horst Bunke: Approximation of Graph Edit Distance by Means of a Utility Matrix. ANNPR 2016: 185-194<\/li><li>Xavier Cort\u00e9s, Francesc Serratosa, Kaspar Riesen: On the Relevance of Local Neighbourhoods for Greedy Graph Edit Distance. S+SSPR 2016: 121-131<\/li><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: A Novel Graph Database for Handwritten Word Images. S+SSPR 2016: 553-563<\/li><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Graph-Based Keyword Spotting in Historical Handwritten Documents. S+SSPR 2016: 564-573<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2015<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Andreas Fischer, Seiichi Uchida, Volkmar Frinken, Kaspar Riesen, Horst Bunke: Improving Hausdorff Edit Distance Using Structural Node Context. GbRPR 2015: 148-157<\/li><li>Miquel Ferrer, Francesc Serratosa, Kaspar Riesen: A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching. GbRPR 2015: 77-86<\/li><li>Kaspar Riesen, Miquel Ferrer, Andreas Fischer, Horst Bunke: Approximation of Graph Edit Distance in Quadratic Time. GbRPR 2015: 3-12<\/li><li>Brian Kenji Iwana, Seiichi Uchida, Kaspar Riesen, Volkmar Frinken: Tackling temporal pattern recognition by vector space embedding. ICDAR 2015: 816-820<\/li><li>Hans Friedrich Witschel, Simon Loo, Kaspar Riesen: How to Support Customer Segmentation with Useful Cluster Descriptions. ICDM 2015: 17-31<\/li><li>Kaspar Riesen, Miquel Ferrer, Andreas Fischer: Building Classifier Ensembles Using Greedy Graph Edit Distance. MCS 2015: 125-134<\/li><li>Kaspar Riesen, Miquel Ferrer, Horst Bunke: Suboptimal Graph Edit Distance Based on Sorted Local Assignments. MCS 2015: 147-156<\/li><li>Miquel Ferrer, Francesc Serratosa, Kaspar Riesen: Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation. MLDM 2015: 17-31<\/li><li>Kaspar Riesen, Miquel Ferrer, Rolf Dornberger, Horst Bunke: Greedy Graph Edit Distance. MLDM 2015: 3-16<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2014<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Andreas Fischer, Horst Bunke: Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation. ANNPR 2014: 117-128<\/li><li>Kaspar Riesen, Andreas Fischer, Horst Bunke: Computing Upper and Lower Bounds of Graph Edit Distance in Cubic Time. ANNPR 2014: 129-140<\/li><li>Kaspar Riesen, Rolf Dornberger, Horst Bunke: Iterative Bipartite Graph Edit Distance Approximation. Document Analysis Systems 2014: 61-65<\/li><li>Kaspar Riesen, Darko Brodic, Zoran N. Milivojevic, Cedomir A. Maluckov: Graph Based Keyword Spotting in Medieval Slavic Documents &#8211; A Project Outline. EuroMed 2014: 724-731<\/li><li>Kaspar Riesen, Horst Bunke: Improving Approximate Graph Edit Distance by Means of a Greedy Swap Strategy. ICISP 2014: 314-321<\/li><li>Kaspar Riesen, Horst Bunke, Andreas Fischer: Improving Graph Edit Distance Approximation by Centrality Measures. ICPR 2014: 3910-3914<\/li><li>Andreas Fischer, R\u00e9jean Plamondon, Yvon Savaria, Kaspar Riesen, Horst Bunke: A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance. S+SSPR 2014: 83-92<\/li><li>Benoit Ga\u00fcz\u00e8re, S\u00e9bastien Bougleux, Kaspar Riesen, Luc Brun: Approximate Graph Edit Distance Guided by Bipartite Matching of Bags of Walks. S+SSPR 2014: 73-82<\/li><li>Kaspar Riesen, Andreas Fischer, Horst Bunke: Improving Approximate Graph Edit Distance Using Genetic Algorithms. S+SSPR 2014: 63-72<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2013<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Andreas Fischer, Ching Y. Suen, Volkmar Frinken, Kaspar Riesen, Horst Bunke: A Fast Matching Algorithm for Graph-Based Handwriting Recognition. GbRPR 2013: 194-203<\/li><li>Kaspar Riesen, Sandro Emmenegger, Horst Bunke: A Novel Software Toolkit for Graph Edit Distance Computation. GbRPR 2013: 142-151<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2011<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Stefan Fankhauser, Kaspar Riesen, Horst Bunke: Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching. GbRPR 2011: 102-111<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2010<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Andreas Fischer, Kaspar Riesen, Horst Bunke: Graph Similarity Features for HMM-Based Handwriting Recognition in Historical Documents. ICFHR 2010: 253-258<\/li><li>Jonas Richiardi, Dimitri Van De Ville, Kaspar Riesen, Horst Bunke: Vector Space Embedding of Undirected Graphs with Fixed-cardinality Vertex Sequences for Classification. ICPR 2010: 902-905<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2009<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Horst Bunke: Feature Ranking Algorithms for Improving Classification of Vector Space Embedded Graphs. CAIP 2009: 377-384<\/li><li>Kaspar Riesen, Volkmar Frinken, Horst Bunke: Improving Graph Classification by Isomap. GbRPR 2009: 205-214<\/li><li>Kaspar Riesen, Stefan Fankhauser, Horst Bunke, Peter J. Dickinson: Efficient Suboptimal Graph Isomorphism. GbRPR 2009: 124-133<\/li><li>Kaspar Riesen, Horst Bunke: Cluster Ensembles Based on Vector Space Embeddings of Graphs. MCS 2009: 211-221<\/li><li>Kaspar Riesen, Horst Bunke: Dissimilarity Based Vector Space Embedding of Graphs Using Prototype Reduction Schemes. MLDM 2009: 617-631<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2008<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Horst Bunke: Kernel k-Means Clustering Applied to Vector Space Embeddings of Graphs. ANNPR 2008: 24-35<\/li><li>Miquel Ferrer, Ernest Valveny, Francesc Serratosa, Kaspar Riesen, Horst Bunke: An approximate algorithm for median graph computation using graph embedding. ICPR 2008: 1-4<\/li><li>Andreas Fischer, Kaspar Riesen, Horst Bunke: An experimental study of graph classification using prototype selection. ICPR 2008: 1-4<\/li><li>Alexandra Br\u00fcgger, Horst Bunke, Peter J. Dickinson, Kaspar Riesen: Generalized Graph Matching for Data Mining and Information Retrieval. ICDM 2008: 298-312<\/li><li>Kaspar Riesen, Horst Bunke: On Lipschitz Embeddings of Graphs. KES (1) 2008: 131-140<\/li><li>Horst Bunke, Kaspar Riesen: Recent Developments in Graph Classification and Clustering using Graph Embedding Kernels. PRIS 2008: 3-13<\/li><li>Kaspar Riesen, Horst Bunke: Non-linear Transformations of Vector Space Embedded Graphs. PRIS 2008: 173-183<\/li><li>Horst Bunke, Kaspar Riesen: Graph Classification on Dissimilarity Space Embedding. SSPR\/SPR 2008: 2<\/li><li>Horst Bunke, Kaspar Riesen: Graph Classification Based on Dissimilarity Space Embedding. SSPR\/SPR 2008: 996-1007<\/li><li>Kaspar Riesen, Horst Bunke: IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning. SSPR\/SPR 2008: 287-297<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2007<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Horst Bunke, Kaspar Riesen: A Family of Novel Graph Kernels for Structural Pattern Recognition. CIARP 2007: 20-31<\/li><li>Kaspar Riesen, Michel Neuhaus, Horst Bunke: Bipartite Graph Matching for Computing the Edit Distance of Graphs. GbRPR 2007: 1-12<\/li><li>Kaspar Riesen, Michel Neuhaus, Horst Bunke: Graph Embedding in Vector Spaces by Means of Prototype Selection. GbRPR 2007: 383-393<\/li><li>Kaspar Riesen, Horst Bunke: Structural Classifier Ensembles for Vector Space Embedded Graphs. IJCNN 2007: 1500-1505<\/li><li>Kaspar Riesen, Horst Bunke: Classifier Ensembles for Vector Space Embedding of Graphs. MCS 2007: 220-230<\/li><li>Kaspar Riesen, Vivian Kilchherr, Horst Bunke: Reducing the Dimensionality of Vector Space Embeddings of Graphs. MLDM 2007: 563-573<\/li><li>Kaspar Riesen, Stefan Fankhauser, Horst Bunke: Speeding Up Graph Edit Distance Computation with a Bipartite Heuristic. MLG 2007<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2006<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Michel Neuhaus, Kaspar Riesen, Horst Bunke: Fast Suboptimal Algorithms for the Computation of Graph Edit Distance. SSPR\/SPR 2006: 163-172<\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Book Chapters<\/h2>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2020<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Paul Maergner, Kaspar Riesen, Rolf Ingold and Andreas Fischer: Signature Verification via Graph-Based Methods. Handbook of Pattern Recognition and Computer Vision 2020: 305\u2013322<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2018<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li><span style=\"color: var(--ast-global-color-3); font-size: 1rem; font-weight: inherit;\">Michael Stauffer, Andreas Fischer, Kaspar Riesen: Searching and Browsing in Historical Documents \u2014 State of the Art and Novel Approaches for Template-Based Keyword Spotting. Business Information Systems and Technology 4.0. 2018<\/span><\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2016<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li><span style=\"color: var(--ast-global-color-3); font-size: 1rem; font-weight: inherit;\">Kaspar Riesen, Horst Bunke: Graph Edit Distance &#8211; Novel Approximation Algorithms. Handbook of Pattern Recognition and Computer Vision 2016: 275-291<\/span><\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2011<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li><span style=\"color: var(--ast-global-color-3); font-size: 1rem; font-weight: inherit;\">Kaspar Riesen, Horst Bunke: Classification and Clustering of Vector Space Embedded Graphs. Emerging Topics in Computer Vision and its Applications 2011: 49\u201370<\/span><\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2010<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li><span style=\"color: var(--ast-global-color-3); font-size: 1rem; font-weight: inherit;\">Kaspar Riesen, Xiaoyi Jiang, Horst Bunke: Exact and Inexact Graph Matching: Methodology and Applications. Managing and Mining Graph Data 2010: 217-247<\/span><\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2009<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li><span style=\"color: var(--ast-global-color-3); font-size: 1rem; font-weight: inherit;\">Horst Bunke and Kaspar Riesen: On Dissimilarity Embedding of Graphs in Vector Spaces. Handbook of Pattern Recognition and Computer Vision 2009: 47\u201371<\/span><\/li><\/ul>\n\n\n\n<h2 class=\"wp-block-heading\">Books<\/h2>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2019<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Michael Stauffer, Andreas Fischer, Kaspar Riesen: Graph-Based Keyword Spotting. Series in Machine Perception and Artificial Intelligence 86, WorldScientific 2019, ISBN 978-981-120-662-7, pp. 1-296<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2015<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen: Structural Pattern Recognition with Graph Edit Distance &#8211; Approximation Algorithms and Applications. Advances in Computer Vision and Pattern Recognition, Springer 2015, ISBN 978-3-319-27251-1, pp. 3-156<\/li><\/ul>\n\n\n\n<h6 class=\"wp-block-heading\"><strong>2010<\/strong><\/h6>\n\n\n\n<ul class=\"wp-block-list\"><li>Kaspar Riesen, Horst Bunke: Graph Classification and Clustering Based on Vector Space Embedding. Series in Machine Perception and Artificial Intelligence 77, WorldScientific 2010, ISBN 978-981-4304-71-9, pp. 1-348<\/li><\/ul>\n<\/div>\n<\/div><\/section>\n","protected":false},"excerpt":{"rendered":"<p>Publications Journal papers 2022 Mathias Fuchs, Kaspar Riesen: A novel way to formalize stable graph cores by using matching-graphs. Pattern Recognit. 131: 108846 (2022) 2020 Michael Stauffer, Andreas Fischer, Kaspar Riesen: Filters for graph-based keyword spotting in historical handwritten documents. Pattern Recognit. Lett. 134: 125-134 (2020) Kaspar Riesen, Miquel Ferrer, Horst Bunke: Approximate Graph Edit &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/prg.inf.unibe.ch\/index.php\/publications\/\"> <span class=\"screen-reader-text\">Publications_23102022<\/span> Read More &raquo;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_uag_custom_page_level_css":"","site-sidebar-layout":"no-sidebar","site-content-layout":"plain-container","ast-global-header-display":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"disabled","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"enabled","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","footnotes":""},"class_list":["post-1066","page","type-page","status-publish","hentry"],"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false},"uagb_author_info":{"display_name":"prg-admin","author_link":"https:\/\/prg.inf.unibe.ch\/index.php\/author\/prg-admin\/"},"uagb_comment_info":0,"uagb_excerpt":"Publications Journal papers 2022 Mathias Fuchs, Kaspar Riesen: A novel way to formalize stable graph cores by using matching-graphs. Pattern Recognit. 131: 108846 (2022) 2020 Michael Stauffer, Andreas Fischer, Kaspar Riesen: Filters for graph-based keyword spotting in historical handwritten documents. Pattern Recognit. Lett. 134: 125-134 (2020) Kaspar Riesen, Miquel Ferrer, Horst Bunke: Approximate Graph Edit&hellip;","_links":{"self":[{"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/pages\/1066","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/comments?post=1066"}],"version-history":[{"count":4,"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/pages\/1066\/revisions"}],"predecessor-version":[{"id":1115,"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/pages\/1066\/revisions\/1115"}],"wp:attachment":[{"href":"https:\/\/prg.inf.unibe.ch\/index.php\/wp-json\/wp\/v2\/media?parent=1066"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}