Journal ArticleDOI
Approximate graph edit distance computation by means of bipartite graph matching
Kaspar Riesen,Horst Bunke +1 more
Reads0
Chats0
TLDR
A novel algorithm is introduced which allows us to approximately, or suboptimally, compute edit distance in a substantially faster way and is emprically verified that the accuracy of the suboptimal distance remains sufficiently accurate for various pattern recognition applications.About:
This article is published in Image and Vision Computing.The article was published on 2009-06-01. It has received 654 citations till now. The article focuses on the topics: Graph operations & Line graph.read more
Citations
More filters
Random Graph Prototypes for Noisy Biometric Graphs
TL;DR: Riesen and Bunke (2010) demonstrated that the dissimilarity representation approach proposed by Pekalska and Duin (2005) outperforms traditional pattern recognition systems when applied to the domain of noisy graphs, and demonstrated that a well defined set of prototypes is necessary for successful matching.
Book ChapterDOI
Searching and Browsing in Historical Documents—State of the Art and Novel Approaches for Template-Based Keyword Spotting
TL;DR: This chapter reviews and compares different state-of-the-art as well as novel approaches for template-based KWS, which can be applied to documents without any a priori learning of a model and is regarded as the more flexible approach.
Journal ArticleDOI
A process-oriented spatiotemporal clustering method for complex trajectories
TL;DR: The proposed Process-Oriented Spatiotemporal Clustering Method (POSCM) is applied to the sea surface temperature abnormal variations trajectories from January 1950 to December 2017 in the Pacific Ocean and can provide new references for understanding the behaviours of marine abnormal variations under the background of the global change.
Posted Content
Graphon based Clustering and Testing of Networks: Algorithms and Theory.
TL;DR: In this article, a sorting-and-smoothing graphon estimator is proposed for clustering multiple graphs without vertex correspondence, inspired by the recent literature on estimating graphons.
Proceedings ArticleDOI
Chemical Similarity Based on Map Edit Distance
TL;DR: A novel algorithm for computing the Molecular similarity, which is able to give rise to many new possibilities for understanding the relationship between molecules, is developed.
References
More filters
Journal ArticleDOI
The Protein Data Bank
Helen M. Berman,John D. Westbrook,Zukang Feng,Gary L. Gilliland,Talapady N. Bhat,Helge Weissig,Ilya N. Shindyalov,Philip E. Bourne +7 more
TL;DR: The goals of the PDB are described, the systems in place for data deposition and access, how to obtain further information and plans for the future development of the resource are described.
Journal ArticleDOI
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Journal ArticleDOI
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Related Papers (5)
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
Kaspar Riesen,Horst Bunke +1 more
A distance measure between attributed relational graphs for pattern recognition
Alberto Sanfeliu,King-Sun Fu +1 more