A hyperbolic embedding for scale-free networks

被引:0
|
作者
Shen, Xin [1 ]
Huang, Weijian [1 ]
Gong, Jing [1 ]
Sun, Zhixin [2 ]
机构
[1] Nanjing Univ Posts & Telecommun, Sch Sci, Nanjing, Peoples R China
[2] Nanjing Univ Posts & Telecommun, Post Big Data Technol & Applicat Engn Res Ctr Jia, Post Ind Technol Res & Dev Ctr, State Posts Bur Internet Things Technol, Nanjing, Peoples R China
来源
2021 IEEE INTL CONF ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, INTL CONF ON PERVASIVE INTELLIGENCE AND COMPUTING, INTL CONF ON CLOUD AND BIG DATA COMPUTING, INTL CONF ON CYBER SCIENCE AND TECHNOLOGY CONGRESS DASC/PICOM/CBDCOM/CYBERSCITECH 2021 | 2021年
基金
中国国家自然科学基金;
关键词
hyperbolic space; graph convolution; variational graph auto-encoder; scale-free networks;
D O I
10.1109/DASC-PICom-CBDCom-CyberSciTech52372.2021.00114
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Graph neural network, with its powerful learning ability, has become a cutting-edge method of processing ultra-large-scale network data. In order to polished up the representation accuracy of embedding, the key is to find the intrinsic geometric metric of the complex network. Since the real data is mostly scale-free network, the embedding accuracy of traditional models is still limited by the dimensionality of the euclidean space and computational complexity. Therefore, the hyperbolic embedding, whose metric properties conform to the power-law distribution and tree-like hierarchical structure of the complex network, will effectively approximates the latent lowdimensional manifold of the data distribution. This paper proposes an auto-encoder in hyperbolic space (HVGAE), taking full use of hyperbolic graph convolutional (HGCN) and the idea of variational autoencoder. Under the optimal combination of the encoder module, competitive results have been achieved in different real scenarios.
引用
收藏
页码:679 / 685
页数:7
相关论文
共 50 条
  • [1] Exactly scale-free scale-free networks
    Zhang, Linjun
    Small, Michael
    Judd, Kevin
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2015, 433 : 182 - 197
  • [2] Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry
    Blasius, Thomas
    Freiberger, Cedric
    Friedrich, Tobias
    Katzmann, Maximilian
    Montenegro-Retana, Felix
    Thieffry, Marianne
    ACM TRANSACTIONS ON ALGORITHMS, 2022, 18 (02)
  • [3] On Searching Multiple Disjoint Shortest Paths in Scale-Free Networks With Hyperbolic Geometry
    Wang, Qiang
    Jiang, Hao
    Jiang, Ying
    Yi, Shuwen
    Li, Lixia
    Xing, Cong-Cong
    Huang, Jun
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2022, 9 (04): : 2772 - 2785
  • [4] Scale-free networks in evolution
    Campos, PRA
    de Oliveira, VM
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2003, 325 (3-4) : 570 - 576
  • [5] Scale-free networks in metabolomics
    Rajula, Hema Sekhar Reddy
    Mauri, Matteo
    Fanos, Vassilios
    BIOINFORMATION, 2018, 14 (03) : 140 - 144
  • [6] The modeling of scale-free networks
    Chen, QH
    Shi, DH
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2004, 335 (1-2) : 240 - 248
  • [7] Noisy scale-free networks
    Scholz, J
    Dejori, M
    Stetter, M
    Greiner, M
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2005, 350 (2-4) : 622 - 642
  • [8] Deterministic scale-free networks
    Barabási, AL
    Ravasz, E
    Vicsek, T
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2001, 299 (3-4) : 559 - 564
  • [9] Boolean game on scale-free networks
    Ma, Jing
    Zhou, Pei-Ling
    Zhou, Tao
    Bai, Wen-Jie
    Cai, Shi-Min
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2007, 375 (02) : 709 - 716
  • [10] On the controllability of clustered Scale-Free networks
    Doostmohammadian, Mohammadreza
    Khan, Usman A.
    JOURNAL OF COMPLEX NETWORKS, 2020, 8 (01)