REVIEW 5 cited by
A Survey on Deep Graph Generation: Methods and Applications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Graphs are ubiquitous in encoding relational information of real-world objects in many domains. Graph generation, whose purpose is to generate new graphs from a distribution similar to the observed graphs, has received increasing attention thanks to the recent advances of deep learning models. In this paper, we conduct a comprehensive review on the existing literature of deep graph generation from a variety of emerging methods to its wide application areas. Specifically, we first formulate the problem of deep graph generation and discuss its difference with several related graph learning tasks. Secondly, we divide the state-of-the-art methods into three categories based on model architectures and summarize their generation strategies. Thirdly, we introduce three key application areas of deep graph generation. Lastly, we highlight challenges and opportunities in the future study of deep graph generation. We hope that our survey will be useful for researchers and practitioners who are interested in this exciting and rapidly-developing field.
Forward citations
Cited by 5 Pith papers
-
Fine-Grained Traffic Inference from Road to Lane via Spatio-Temporal Graph Node Generation
A two-stage graph model (RoadDiff) generates lane-level traffic states from road-level data and outperforms 17 baselines on six real-world datasets.
-
Vector Representations of Vessel Trees
VeTTA encodes a vascular tree into one vector and recursively decodes it into a geometrically accurate, topologically valid tree, outperforming voxel-based autoencoders on reconstruction metrics.
-
Random Permutation Codes: Lossless Source Coding of Non-Sequential Data
For any data type defined by an equivalence relation over sequences, there is a Random Permutation Code that achieves the optimal lossless compression rate, with explicit codes for multisets, clusterings, and graphs.
-
A Deep Generative Model for the Simulation of Discrete Karst Networks
A two-step pipeline of a graph recurrent network and a graph denoising diffusion model learns to generate stochastic discrete karst networks from subgraphs of two mapped cave systems, reproducing most geometric and to...
-
Natural Language Processing tools for Pharmaceutical Manufacturing Information Extraction from Patents
An LDA-k-Means section selector and a BiLSTM-CRF NER model extract pharmaceutical manufacturing data from patents, with kappa 91.1% for section selection and micro-F1 84.2% for entity recognition.
Discussion (0). Continue with ORCID to comment.