Decision trees for error-tolerant graph database filtering

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. © Springer-Verlag Berlin Heidelberg 2005.