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
Journal ArticleDOI
A New Method for Measuring Topological Structure Similarity between Complex Trajectories
TL;DR: The Comprehensive Structure Matching (CSM) algorithm is used to examine the 1993 to 2012 complex trajectories of anticyclonic eddies in the South China Sea and shows that the CSM algorithm outperforms the EGED in terms of the computation efficiency.
Journal ArticleDOI
A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees
Matthias Dehmer,Kurt Varmuza +1 more
TL;DR: This paper discusses numerical results for exploring the approximation behavior of the Tanimoto index by GED and discusses cumulative similarity/distance distributions of these measures and other data analysis methods.
Proceedings ArticleDOI
funcGNN: A Graph Neural Network Approach to Program Similarity
TL;DR: In this article, a graph neural network (GNN) is used to estimate the graph edit distance (GED) between programs by analyzing the associated control flow graphs (CFGs).
Journal ArticleDOI
Embedding of graphs with discrete attributes via label frequencies
TL;DR: A new way of embedding discrete attributed graphs into vector spaces using node and edge label frequencies is presented, shown to be competitive to state-of-the-art classification algorithms for graphs, while being computationally much more efficient.
Proceedings ArticleDOI
Sequential Motif Profiles and Topological Plots for Offline Signature Verification
TL;DR: Inspired by the recent use of image visibility graphs for mapping images into networks, their use as a parameter free, agnostic representation for exploring global as well as local information is introduced for the first time in offline SV literature.
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