Induction of Node Label Controlled Graph Grammar Rules

@inproceedings{blockeel2008InductionON,
  title={Induction of Node Label Controlled Graph Grammar Rules},
  author={hendrik. blockeel},
  year={2008}
}
  • hendrik. blockeel
  • Published 2008
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… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…