Interpretable Deep Graph Generation with Node-edge Co-disentanglement.
Xiaojie GuoLiang ZhaoZhao QinLingfei WuAmarda ShehuYanfang YePublished in: KDD (2020)
Keyphrases
- undirected graph
- edge weights
- weighted graph
- graph structure
- directed graph
- disjoint paths
- strongly connected
- densely connected
- spanning tree
- directed acyclic graph
- edge detection
- approximation algorithms
- graph theory
- nodes of a graph
- random graphs
- graph representation
- connected components
- bipartite graph
- finding the shortest path
- shortest path
- root node
- tree structure
- graph model
- graphical models
- vertex set
- random walk
- structured data
- edge information
- graph clustering
- graph mining
- graph construction
- path length
- graph based algorithm
- generation process
- classification rules
- overlapping communities
- betweenness centrality
- edge map
- decision trees