Decision trees for error-tolerant graph database filtering

Authors:
Christophe Irniger;Horst Bunke
Affiliations:
Department of Computer Science, University of Bern, Bern, Switzerland;Department of Computer Science, University of Bern, Bern, Switzerland
Venue:
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Year:
2005

Citing 11
Cited 1

C4.5: programs for machine learning

C4.5: programs for machine learning
Organizing Large Structural Modelbases

IEEE Transactions on Pattern Analysis and Machine Intelligence
On a relation between graph edit distance and maximum common subgraph

Pattern Recognition Letters
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric based on the maximal common subgraph

Pattern Recognition Letters
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function

IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Symbol Recognition by Error-Tolerant Subgraph Matching between Region Adjacency Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Four Metrics for Efficiently Comparing Attributed Trees

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Graph Database Filtering Using Decision Trees

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
A Metric for Comparing Relational Descriptions

IEEE Transactions on Pattern Analysis and Machine Intelligence

Graph matching – challenges and potential solutions

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important topic in pattern recognition is retrieval of candidate patterns from a database according to a given sample input pattern. Using graphs, the database retrieval problem is turned into a graph matching problem. In this paper we propose a method based on decision trees to filter a database of graphs according to a given input graph. The present paper extends previous work concerned with graph and subgraph isomorphism to the case of error-tolerant graph matching.