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
Book ChapterDOI
Error-Tolerant Geometric Graph Similarity
TL;DR: The vertex distance (dissimilarity) and edge distance between two graphs are defined and combined to compute graph distance and an approach to error-tolerant graph similarity using geometric graphs is presented.
Journal ArticleDOI
Decentralized Quality of Service Based System for Energy Trading Among Electric Vehicles
TL;DR: In this paper , the authors proposed a decentralized QoS-based system for P2P energy trading among EV energy providers and consumers, where the system utilizes smart contracts to carry out the matching between EVs and monitor the delivery of a QoSbased PU contract without the presence of a third party.
Journal ArticleDOI
A Quotient Space Formulation for Generative Statistical Analysis of Graphical Data
TL;DR: A quotient structure is utilizes to develop efficient algorithms for computing these quantities, leading to useful statistical tools, including principal component analysis, statistical testing, and modeling.
Proceedings ArticleDOI
Pyramidal Stochastic Graphlet Embedding for Document Pattern Classification
TL;DR: The proposed Pyramidal Stochastic Graphlet Embedding (PSGE) has outperformed the state-of-the-art results in recognition of handwritten words as well as graphical symbols.
Book
FCAIR 2012 Formal Concept Analysis Meets Information Retrieval Workshop co-located with the 35th European Conference on Information Retrieval (ECIR 2013) March 24, 2013, Moscow, Russia
TL;DR: The Formal Concept Analysis Meets Information Retrieval workshop was intended to attract researchers from FCA community to a broad discussion of FCA-based research on information retrieval, and to promote ideas, models, and methods of F CA in the community of Information retrieval.
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