Skip to main content
SpringerLink
Log in

Motif-guided heterogeneous graph deep generation

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

The complex systems in the real-world are commonly associated with multiple types of objects and relations, and heterogeneous graphs are ubiquitous data structures that can inherently represent multimodal interactions between objects. Generating high-quality heterogeneous graphs allows us to understand the implicit distribution of heterogeneous graphs and provides benchmarks for downstream heterogeneous representation learning tasks. Existing works are limited to either merely generating the graph topology with neglecting local semantic information or only generating the graph without preserving the higher-order structural information and the global heterogeneous distribution in generated graphs. To this end, we formulate a general, end-to-end framework— HGEN for generating novel heterogeneous graphs with a newly proposed heterogeneous walk generator. On top of HGEN, we further develop a network motif generator to better characterize the higher-order structural distribution. A novel heterogeneous graph assembler is further developed to adaptively assemble novel heterogeneous graphs from the generated heterogeneous walks and motifs in a stratified manner. The extended model is proven to preserve the local semantic and heterogeneous global distribution of observed graphs with the theoretical guarantee. Lastly, comprehensive experiments on both synthetic and real-world practical datasets demonstrate the power and efficiency of the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Arjovsky M, Chintala S, Bottou L (2017) Wasserstein generative adversarial networks. In: Proc of the ICML

  2. Bojchevski A, Shchur O, Zügner D, Günnemann S (2018) Netgan: generating graphs via random walks. In: Proc of the ICML

  3. Caridá V, Jalilifard A, Mansano A, Cristo R (2019) Can netgan be improved on short random walks? In: Proc of the BRACIS

  4. Carranza AG, Rossi RA, Rao A, Koh E (2020) Higher-order clustering in complex heterogeneous networks. In Proc of the KDD, pp 25–35

  5. De Cao N, Kipf T (2018) Molgan: an implicit generative model for small molecular graphs. arXiv preprint arXiv:1805.11973

  6. Dong Y, Chawla NV, Swami A (2017) metapath2vec: scalable representation learning for heterogeneous networks. In: Proc of the KDD

  7. Fu T-y, Lee W-C, Lei Z (2017) Hin2vec: explore meta-paths in heterogeneous information networks for representation learning. In: Proc of the CIKM

  8. Gamage A, Chien E, Peng J, Milenkovic O (2020) Multi-motifgan (mmgan): motif-targeted graph generation and prediction. In: Proc of the ICASSP, pp 4182–4186

  9. Goodfellow I, Pouget-Abadie J, Mirza M, Xu B, Warde-Farley D, Ozair S, Courville A, Bengio Y (2014) Generative adversarial nets. In: Proc of the NeurIPS

  10. Goyal N, Jain HV, Ranu S (2020) Graphgen: A scalable approach to domain-agnostic labeled graph generation. In: Proc. of the WebConf, pp. 1253–1263

  11. Guo X, Zhao L (2020) A systematic survey on deep generative models for graph generation. arXiv preprint arXiv:2007.06686

  12. Guo X, Zhao L, Nowzari C, Rafatirad S, Homayoun H, Dinakarrao SMP (2019) Deep multi-attributed graph translation with node-edge co-evolution. In: Proc of the ICDM, pp 250–259

  13. Gupta A (2012) Generating large-scale heterogeneous graphs for benchmarking. In Specifying big data benchmarks, pp 113–128

  14. Honda S, Akita H, Ishiguro K, Nakanishi T, Oono K (2019) Graph residual flow for molecular graph generation. arXiv preprint arXiv:1909.13521

  15. Huang Z, Zheng Y, Cheng R, Sun Y, Mamoulis N, Li X (2016) Meta structure: computing relevance in large heterogeneous information networks. In: Proc of the KDD, pp 1595–1604

  16. Hu Z, Dong Y, Wang K, Sun Y (2020) Heterogeneous graph transformer. In: Proc of the WebConf, pp 2704–2710

  17. Jang E, Gu S, Poole B (2016) Categorical reparameterization with Gumbel-Softmax. arXiv preprint arXiv:1611.01144

  18. Kipf TN, Welling M (2016) Variational graph auto-encoders. arXiv preprint arXiv:1611.07308

  19. Li J, Peng H, Cao Y, Dou Y, Zhang H, Philip SY, He L (2021) Higher-order attribute-enhancing heterogeneous graph neural networks. IEEE Trans Knowl Data Eng 35(1):560–574

    Google Scholar 

  20. Ling C, Cao H, Zhao L (2022) Stgen: deep continuous-time spatiotemporal graph generation. In: 2022 European conference on machine learning and principles of knowledge discovery in databases

  21. Ling C, Chowdhury T, Jiang J, Wang J, Zhang X, Chen H, Zhao L (2022) Deepgar: deep graph learning for analogical reasoning. In: Proc of the ICDM

  22. Ling C, Jiang J, Wang J, Liang Z (2022) Source localization of graph diffusion via variational autoencoders for graph inverse problems. In: Proceedings of the 28th ACM SIGKDD conference on knowledge discovery and data mining, pp 1010–1020

  23. Ling C, Yang C, Zhao L (2021) Deep generation of heterogeneous networks. In: 2021 IEEE international conference on data mining (ICDM), pp 379–388

  24. Shi C, Li Y, Zhang J, Sun Y, Philip SY (2016) A survey of heterogeneous information network analysis. TKDE 29(1):17–37

    Google Scholar 

  25. Shi C, Zhang Z, Luo P, Yu PS, Yue Y, Wu B (2015) Semantic path based personalized recommendation on weighted heterogeneous information networks. In: Proc of the CIKM, pp 453–462

  26. Simonovsky M, Komodakis N (2018) Graphvae: towards generation of small graphs using variational autoencoders. In: Proc of the ICANN, pp 412–422

  27. Sun Y, Han J, Yan X, Yu PS, Wu T (2011) Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc. VLDB Endow 4(11):992–1003

    Article  Google Scholar 

  28. Sun Y, Han J (2013) Meta-path-based search and mining in heterogeneous information networks. Tsinghua Science and Technology

  29. Sun L, He L, Huang Z, Cao B, Xia C, Wei X, Philip SY (2018) Joint embedding of meta-path and meta-graph for heterogeneous information networks. In: Proc of the ICBK, pp 131–138

  30. Sun M, Li P (2019) Graph to graph: a topology aware approach for graph structures learning and generation. In: Proc of the AISTATS

  31. Sun Y, Norick B, Han J, Yan X, Yu PS, Yu X (2013) Pathselclus: Integrating meta-path selection with user-guided object clustering in heterogeneous information networks. ACM Trans Knowl Disc Data (TKDD) 7(3):1–23

  32. Wang S, Guo X, Zhao L (2022) Deep generative model for periodic graphs. In: Proc of the NeurIPS

  33. Wang X, Ji H, Shi C, Wang B, Ye Y, Cui P, Yu PS (2019) Heterogeneous graph attention network. In: Proc of the WebConf

  34. Wang H, Wang J, Wang J, Zhao M, Zhang W, Zhang F, Xie X, Guo M (2018) Graphgan: graph representation learning with generative adversarial nets. In: Proc of the AAAI

  35. Wu L, Cui P, Pei J, Zhao L, Guo X (2022) Graph neural networks: foundations, frontiers, and applications. In: Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp 4840–4841

  36. Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Networks Learn Syst 32(1):4–24

  37. Yang C, Xiao Y, Zhang Y, Sun Y, Han J (2020) Heterogeneous network representation learning: a unified framework with survey and benchmark. IEEE Trans Knowl Data Eng 34(10):4854–4873

  38. Yang C, Zhuang P, Shi W, Luu A, Li P (2019) Conditional structure generation through graph variational generative adversarial nets. In: Proc of the NIPS, pp 1340–1351

  39. You J, Ying R, Ren X, Hamilton W, Leskovec J (2018) Graphrnn: generating realistic graphs with deep auto-regressive models. In: Proc of the ICML

  40. Yun S, Jeong M, Kim R, Kang J, Kim HJ (2019) Graph transformer networks. In: Proc of the NIPS, pp 11983–11993

  41. Zhang W, Paudel B, Wang L, Chen J, Zhu H, Zhang W, Bernstein A, Chen H (2019) Iteratively learning embeddings and rules for knowledge graph reasoning. In: Proc of the WebConf, pp 2366–2377

  42. Zhao L (2021) Event prediction in the big data era: a systematic survey. CSUR 54(5):1–37

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Emory University, Atlanta, GA, 30332, USA

    Chen Ling, Carl Yang & Liang Zhao

Authors
  1. Chen Ling
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carl Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang Zhao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liang Zhao.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ling, C., Yang, C. & Zhao, L. Motif-guided heterogeneous graph deep generation. Knowl Inf Syst 65, 3099–3124 (2023). https://doi.org/10.1007/s10115-023-01863-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-023-01863-0

Keywords

Search

Navigation