Nearest Neighbours Graph Variational AutoEncoder

被引:1
|
作者
Arsini, Lorenzo [1 ,2 ]
Caccia, Barbara [3 ]
Ciardiello, Andrea [2 ]
Giagu, Stefano [1 ,2 ]
Mancini Terracciano, Carlo [1 ,2 ]
机构
[1] Sapienza Univ Rome, Dept Phys, I-00185 Rome, Italy
[2] INFN, Sect Rome, I-00185 Rome, Italy
[3] Ist Super Sanita, I-00161 Rome, Italy
关键词
graph neural network; variational autoencoder; pooling; nearest neighbours;
D O I
10.3390/a16030143
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graphs are versatile structures for the representation of many real-world data. Deep Learning on graphs is currently able to solve a wide range of problems with excellent results. However, both the generation of graphs and the handling of large graphs still remain open challenges. This work aims to introduce techniques for generating large graphs and test the approach on a complex problem such as the calculation of dose distribution in oncological radiotherapy applications. To this end, we introduced a pooling technique (ReNN-Pool) capable of sampling nodes that are spatially uniform without computational requirements in both model training and inference. By construction, the ReNN-Pool also allows the definition of a symmetric un-pooling operation to recover the original dimensionality of the graphs. We also present a Variational AutoEncoder (VAE) for generating graphs, based on the defined pooling and un-pooling operations, which employs convolutional graph layers in both encoding and decoding phases. The performance of the model was tested on both the realistic use case of a cylindrical graph dataset for a radiotherapy application and the standard benchmark dataset sprite. Compared to other graph pooling techniques, ReNN-Pool proved to improve both performance and computational requirements.
引用
收藏
页数:17
相关论文
共 50 条
  • [1] Epitomic Variational Graph Autoencoder
    Khan, Rayyan Ahmad
    Anwaar, Muhammad Umer
    Kleinsteuber, Martin
    2020 25TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2021, : 7203 - 7210
  • [2] Multiresolution equivariant graph variational autoencoder
    Hy, Truong Son
    Kondor, Risi
    MACHINE LEARNING-SCIENCE AND TECHNOLOGY, 2023, 4 (01):
  • [3] Graph Learning on K Nearest Neighbours for Automatic Image Annotation
    Su, Feng
    Xue, Like
    ICMR'15: PROCEEDINGS OF THE 2015 ACM INTERNATIONAL CONFERENCE ON MULTIMEDIA RETRIEVAL, 2015, : 403 - 410
  • [4] A new graph related to the directions of nearest neighbours in a point process
    Chiu, SN
    Molchanov, IS
    ADVANCES IN APPLIED PROBABILITY, 2003, 35 (01) : 47 - 55
  • [5] MoVAE: A Variational AutoEncoder for Molecular Graph Generation
    Lin, Zerun
    Zhang, Yuhan
    Duan, Lixin
    Ou-Yang, Le
    Zhao, Peilin
    PROCEEDINGS OF THE 2023 SIAM INTERNATIONAL CONFERENCE ON DATA MINING, SDM, 2023, : 514 - 522
  • [6] Interpretable Variational Graph Autoencoder with Noninformative Prior
    Sun, Lili
    Liu, Xueyan
    Zhao, Min
    Yang, Bo
    FUTURE INTERNET, 2021, 13 (02): : 1 - 15
  • [7] Optimizing Variational Graph Autoencoder for Community Detection
    Choong, Jun Jin
    Liu, Xin
    Murata, Tsuyoshi
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 5353 - 5358
  • [8] Dataset Recommendation via Variational Graph Autoencoder
    Altaf, Basmah
    Akujuobi, Uchenna
    Yu, Lu
    Zhang, Xiangliang
    2019 19TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2019), 2019, : 11 - 20
  • [9] SHARPNESS IN THE k-NEAREST-NEIGHBOURS RANDOM GEOMETRIC GRAPH MODEL
    Falgas-Ravry, Victor
    Walters, Mark
    ADVANCES IN APPLIED PROBABILITY, 2012, 44 (03) : 617 - 634
  • [10] Variational Graph Autoencoder with Mutual Information Maximization for Graph Representations Learning
    Li, Dongjie
    Li, Dong
    Lian, Guang
    INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 2022, 36 (09)