Sciweavers

FLAIRS
2003

MDL-Based Context-Free Graph Grammar Induction

13 years 5 months ago
MDL-Based Context-Free Graph Grammar Induction
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.
Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where FLAIRS
Authors Istvan Jonyer, Lawrence B. Holder, Diane J. Cook
Comments (0)