DIGGED converts DAGs into unambiguous, compact rule sequences via induced graph grammars, enabling valid and state-of-the-art generative modeling and Bayesian optimization.
if a neighbor has edge direction d, edge label β, and label σ, form an edge with direction d′ labeled γ to node x ∈ VS
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Directed Graph Grammars for Sequence-based Learning
DIGGED converts DAGs into unambiguous, compact rule sequences via induced graph grammars, enabling valid and state-of-the-art generative modeling and Bayesian optimization.