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 条
  • [41] Regression Conformal Prediction with Nearest Neighbours
    Papadopoulos, Harris
    Vovk, Vladimir
    Gammerman, Alex
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2011, 40 : 815 - 840
  • [42] Nearest-Neighbours for Time Series
    Juan Manuel Gimeno Illa
    Javier Béjar Alonso
    Miquel Sànchez Marré
    Applied Intelligence, 2004, 20 : 21 - 35
  • [43] A cluster problem as defined by nearest neighbours
    Enns, EG
    Ehlers, PF
    Misi, T
    CANADIAN JOURNAL OF STATISTICS-REVUE CANADIENNE DE STATISTIQUE, 1999, 27 (04): : 843 - 851
  • [44] Nearest-neighbours for time series
    Illa, JMG
    Alonso, JB
    Marré, MS
    APPLIED INTELLIGENCE, 2004, 20 (01) : 21 - 35
  • [45] Dual stream fusion link prediction for sparse graph based on variational graph autoencoder and pairwise learning
    Li, Xun
    Cai, Hongyun
    Feng, Chuan
    Zhao, Ao
    INFORMATION PROCESSING & MANAGEMENT, 2025, 62 (03)
  • [46] VIGA: A variational graph autoencoder model to infer user interest representations for recommendation
    Gan, Mingxin
    Zhang, Hang
    INFORMATION SCIENCES, 2023, 640
  • [47] Dual stream fusion link prediction for sparse graph based on variational graph autoencoder and pairwise learning
    Li, Xun
    Cai, Hongyun
    Feng, Chuan
    Zhao, Ao
    Information Processing and Management, 62 (03):
  • [48] Variational Autoencoder and Graph Attention Root Cause Localization Model Based on Log Data and Graph Structure
    Ding, Jianli
    Yan, Yanan
    Wang, Jing
    Chen, Tantan
    ADVANCED INTELLIGENT COMPUTING TECHNOLOGY AND APPLICATIONS, PT IV, ICIC 2024, 2024, 14878 : 17 - 29
  • [49] Adversarial learning based residual variational graph normalized autoencoder for network representation
    Shen, Zhengran
    Guo, Xiaoxin
    Feng, Bo
    Cheng, Hangyuan
    Ni, Shuang
    Dong, Hongliang
    INFORMATION SCIENCES, 2023, 640
  • [50] Permutation-Invariant Variational Autoencoder for Graph-Level Representation Learning
    Winter, Robin
    Noe, Frank
    Clevert, Djork-Arne
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 34 (NEURIPS 2021), 2021, 34