Induction of Node Label Controlled Graph Grammar Rules
published: Aug. 25, 2008, recorded: July 2008, views: 4365
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Algorithms for inducing graph grammars from sets of graphs have been proposed before. An important class of such algorithms are those based on the Subdue graph mining system. But the rules learned by Subdue and its derivatives do not fit easily in any of the well-studied graph grammars formalisms. In this paper, we discuss how Subdue-like algorithms could be made to work in the context of NLC grammars, an important class of node replacement graph grammars. More specifically, we show how, given a set of occurrences of a subgraph, an NLC grammar rule can be induced such that the given occurrences could have been generated by it.
Download slides: mlg08_blockeel_inl_01.pdf (331.4 KB)
Download slides: mlg08_blockeel_inl_01.ppt (159.5 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !