MDL-BASED CONTEXT-FREE GRAPH GRAMMAR INDUCTION AND APPLICATIONS

ISTVAN JONYER, LAWRENCE B. HOLDER, DIANE J. COOK
2004 International journal on artificial intelligence tools  
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 relationships. We present an illustrative example, demonstrate the algorithm's ability to learn in the presence of noise, and show real-world examples.
doi:10.1142/s0218213004001429 fatcat:j3qydsalmrgypalb6hlcmqh66m