Graph Database Filtering Using Decision Trees

Authors:
Christophe Irniger;Horst Bunke
Affiliations:
University of Bern, Switzerland;University of Bern, Switzerland
Venue:
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
Year:
2004

Citing 0
Cited 4

Indexing Hierarchical Structures Using Graph Spectra

IEEE Transactions on Pattern Analysis and Machine Intelligence
Decision trees for filtering large databases of graphs

International Journal of Intelligent Systems Technologies and Applications
Graph matching – challenges and potential solutions

ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Decision trees for error-tolerant graph database filtering

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graphs are a powerful representation formalism for structural data. They are, however, very expensive from the computational point of view. In pattern recognition it is often necessary to match an unknown sample against a database of candidate patterns. In this process, however, the size of the database is introduced as an additional factor into the overall complexity of the matching process. To reduce the influence of that factor, an approach based on machine learning techniques is proposed in this paper. Graphs are represented using feature vectors. Based on these vectors a decision tree is built to index the database. The decision tree allows at runtime to eliminate a number of graphs from the database as possible matching candidates.