Interpretable Deep Graph Generation with Node-edge Co-disentanglement

44Citations
Citations of this article
53Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Disentangled representation learning has recently attracted a significant amount of attention, particularly in the field of image representation learning. However, learning the disentangled representations behind a graph remains largely unexplored, especially for the attributed graph with both node and edge features. Disentanglement learning for graph generation has substantial new challenges including 1) the lack of graph deconvolution operations to jointly decode node and edge attributes; and 2) the difficulty in enforcing the disentanglement among latent factors that respectively influence: i) only nodes, ii) only edges, and iii) joint patterns between them. To address these challenges, we propose a new disentanglement enhancement framework for deep generative models for attributed graphs. In particular, a novel variational objective is proposed to disentangle the above three types of latent factors, with novel architecture for node and edge deconvolutions. Qualitative and quantitative experiments on both synthetic and real-world datasets demonstrate the effectiveness of the proposed model and its extensions.

Cite

CITATION STYLE

APA

Guo, X., Zhao, L., Qin, Z., Wu, L., Shehu, A., & Ye, Y. (2020). Interpretable Deep Graph Generation with Node-edge Co-disentanglement. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (pp. 1697–1707). Association for Computing Machinery. https://doi.org/10.1145/3394486.3403221

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free