Towards Interpretable Graph Modeling with Vertex Replacement Grammars

10/18/2019
by   Justus Hibshman, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/21/2023

Dynamic Vertex Replacement Grammars

Context-free graph grammars have shown a remarkable ability to model str...
research
01/04/2019

Sheaves: A Topological Approach to Big Data

This document develops general concepts useful for extracting knowledge ...
research
10/18/2021

Label-Descriptive Patterns and their Application to Characterizing Classification Errors

State-of-the-art deep learning methods achieve human-like performance on...
research
04/27/2022

Discovering Representative Attribute-stars via Minimum Description Length

Graphs are a popular data type found in many domains. Numerous technique...
research
08/02/2013

Inverse Procedural Modeling of Facade Layouts

In this paper, we address the following research problem: How can we gen...
research
08/10/2016

Growing Graphs with Hyperedge Replacement Graph Grammars

Discovering the underlying structures present in large real world graphs...
research
04/11/2020

Grounding Occam's Razor in a Formal Theory of Simplicity

It is proposed that the Occam's Razor heuristic – when in doubt, choose ...

Please sign up or login with your details

Forgot password? Click here to reset