Graph-based induction for general graph structured data and its applications

Abstract

A machine learning technique called Graph-Based Induction (GBI) efficiently extracts typical patterns from graph data by stepwise pair expansion (pairwise chunking). In this paper, we introduce Graph-Based Induction for general graph structured data, which can handle directed/undirected, colored/uncolored graphs with/without (self) loop and with colored/uncolored links. We show that its time complexity is almost linear with the size of graph. We, further, show that GBI can effectively be applied to the extraction of typical patterns from DNA sequence data and organnochlorine compound data from which to generate classification rules, and that GBI also works as a feature construction component for other machine learning tools.