Gaussian Embedding of Large-Scale Attributed Graphs

被引:4
|
作者
Hettige, Bhagya [1 ]
Li, Yuan-Fang [1 ]
Wang, Weiqing [1 ]
Buntine, Wray [1 ]
机构
[1] Monash Univ, Melbourne, Vic, Australia
来源
关键词
Graph embedding; Link prediction; Node classification;
D O I
10.1007/978-3-030-39469-1_11
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph embedding methods transform high-dimensional and complex graph contents into low-dimensional representations. They are useful for a wide range of graph analysis tasks including link prediction, node classification, recommendation and visualization. Most existing approaches represent graph nodes as point vectors in a low-dimensional embedding space, ignoring the uncertainty present in the real-world graphs. Furthermore, many real-world graphs are large-scale and rich in content (e.g. node attributes). In this work, we propose GLACE, a novel, scalable graph embedding method that preserves both graph structure and node attributes effectively and efficiently in an end-to-end manner. GLACE effectively models uncertainty through Gaussian embeddings, and supports inductive inference of new nodes based on their attributes. In our comprehensive experiments, we evaluate GLACE on real-world graphs, and the results demonstrate that GLACE significantly outperforms state-of-the-art embedding methods on multiple graph analysis tasks.
引用
收藏
页码:134 / 146
页数:13
相关论文
共 50 条
  • [21] Scaling Attributed Network Embedding to Massive Graphs
    Yang, Renchi
    Shi, Jieming
    Xiao, Xiaokui
    Yang, Yin
    Liu, Juncheng
    Bhowmick, Sourav S.
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2020, 14 (01): : 37 - 49
  • [22] Gaussian Process Modeling of Large-Scale Terrain
    Vasudevan, Shrihari
    Ramos, Fabio
    Nettleton, Eric
    Durrant-Whyte, Hugh
    JOURNAL OF FIELD ROBOTICS, 2009, 26 (10) : 812 - 840
  • [23] Group Centrality Maximization for Large-scale Graphs
    Angriman, Eugenio
    van der Grinten, Alexander
    Bojchevski, Aleksandar
    Zuegner, Daniel
    Guennemann, Stephan
    Meyerhenke, Henning
    2020 PROCEEDINGS OF THE SYMPOSIUM ON ALGORITHM ENGINEERING AND EXPERIMENTS, ALENEX, 2020, : 56 - 69
  • [24] Readable representations for large-scale bipartite graphs
    Sato, Shuji
    Misue, Kazuo
    Tanaka, Jiro
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 2, PROCEEDINGS, 2008, 5178 : 831 - 838
  • [25] Efficient Machine Learning On Large-Scale Graphs
    Erickson, Parker
    Lee, Victor E.
    Shi, Feng
    Tang, Jiliang
    PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022, 2022, : 4788 - 4789
  • [26] Generating Large-Scale Heterogeneous Graphs for Benchmarking
    Gupta, Amarnath
    SPECIFYING BIG DATA BENCHMARKS, 2014, 8163 : 113 - 128
  • [27] Efficient mining algorithms for large-scale graphs
    Kishimoto, Yasunari
    Shiokawa, Hiroaki
    Fujiwara, Yasuhiro
    Onizuka, Makoto
    NTT Technical Review, 2013, 11 (12):
  • [28] Parallel generation of large-scale random graphs
    Vullikanti, Anil
    2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), 2018, : 278 - 278
  • [29] Large-scale Machine Learning over Graphs
    Yang, Yiming
    PROCEEDINGS OF THE 2018 ACM SIGIR INTERNATIONAL CONFERENCE ON THEORY OF INFORMATION RETRIEVAL (ICTIR'18), 2018, : 9 - 9
  • [30] Large-scale quantum networks based on graphs
    Epping, Michael
    Kampermann, Hermann
    Bruss, Dagmar
    NEW JOURNAL OF PHYSICS, 2016, 18