Journal article
Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
International Journal of Applied Mathematics and Computer Science, Vol.18(2), pp.241-250
06/01/2008
Handle:
https://hdl.handle.net/2376/117741
Abstract
Inferring Graph Grammars by Detecting Overlap in Frequent SubgraphsIn this paper we study the inference of node and edge replacement graph grammars. We search for frequent subgraphs and then check for an overlap among the instances of the subgraphs in the input graph. If the subgraphs overlap by one node, we propose a node replacement graph grammar production. If the subgraphs overlap by two nodes or two nodes and an edge, we propose an edge replacement graph grammar production. We can also infer a hierarchy of productions by compressing portions of a graph described by a production and then inferring new productions on the compressed graph. We validate the approach in experiments where we generate graphs from known grammars and measure how well the approach infers the original grammar from the generated graph. We show graph grammars found in biological molecules, biological networks, and analyze learning curves of the algorithm.
Metrics
8 Record Views
Details
- Title
- Inferring Graph Grammars by Detecting Overlap in Frequent Subgraphs
- Creators
- Jacek KuklukLawrence HolderDiane Cook
- Publication Details
- International Journal of Applied Mathematics and Computer Science, Vol.18(2), pp.241-250
- Academic Unit
- Electrical Engineering and Computer Science, School of
- Identifiers
- 99900547944001842
- Language
- English
- Resource Type
- Journal article