Istvan Jonyer, Lawrence B. Holder, and Diane J. Cook
We present an algorithm for the inference of context-free graph grammars from examples. The algorithm builds on an earlier system for frequent substructure discovery, and is biased toward grammars that minimize description length. Grammar features include recursion, variables and relation-ships. We present an illustrative example, demonstrate the algorithm’s ability to learn in the presence of noise, and show real-world examples.