作者: Lawrence B. Holder , Jacek P. Kukluk , Diane J. Cook
DOI:
关键词: Line graph 、 Algorithm 、 Mathematics 、 Theoretical computer science 、 Null graph 、 Graph property 、 Directed graph 、 Butterfly graph 、 Simplex graph 、 Complement graph 、 Voltage graph
摘要: In this paper we describe an approach to learning node replacement graph grammars. This is based on previous research in frequent isomorphic subgraphs discovery. We extend the search for by checking overlap among instances of input graph. If one propose a grammar production. also can infer hierarchy productions compressing portions described production and then new compressed validate experiments where generate graphs from known grammars measure how well our system infers original generated briefly discuss other inference systems indicating that study extends classes learnable