Towards Interpretable Graph Modeling with Vertex Replacement Grammars
arXiv:1910.08579 · doi:10.1109/BigData47090.2019.9006204
Abstract
An enormous amount of real-world data exists in the form of graphs. Oftentimes, interesting patterns that describe the complex dynamics of these graphs are captured in the form of frequently reoccurring substructures. Recent work at the intersection of formal language theory and graph theory has explored the use of graph grammars for graph modeling and pattern mining. However, existing formulations do not extract meaningful and easily interpretable patterns from the data. The present work addresses this limitation by extracting a special type of vertex replacement grammar, which we call a KT grammar, according to the Minimum Description Length (MDL) heuristic. In experiments on synthetic and real-world datasets, we show that KT-grammars can be efficiently extracted from a graph and that these grammars encode meaningful patterns that represent the dynamics of the real-world system.
arXiv comment10 pages, 9 figures, accepted at IEEE BigData 2019
References in corpus (10)
- LINE: Large-scale Information Network Embedding
- Random graphs with arbitrary degree distributions and their applications
- Graph Embedding Techniques, Applications, and Performance: A Survey
- Variational Graph Auto-Encoders
- Motifs in Temporal Networks
- GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models
- Community structure and scale-free collections of Erdös-Rényi graphs
- NetGAN: Generating Graphs via Random Walks
- Growing Graphs with Hyperedge Replacement Graph Grammars
- Modeling Graphs with Vertex Replacement Grammars