Learning adaptive neighborhoods for graph neural networks
Graph convolutional networks (GCNs) enable end-to-end learning on graph structured data. However, many works assume a given graph structure. When the input graph is noisy or unavailable, one approach is to construct or learn a latent graph structure. These methods typically fix the choice of node de...
Главные авторы: | Saha, A, Mendez, O, Russell, C, Bowden, R |
---|---|
Формат: | Conference item |
Язык: | English |
Опубликовано: |
IEEE
2024
|
Схожие документы
-
Graph Convolutional Network with Adaptive Fusion of Neighborhood Aggregation and Interaction
по: FU Kun, ZHUO Jiaming, GUO Yunpeng, LI Jianing, LIU Qi
Опубликовано: (2023-02-01) -
Path-Neighborhood Graphs
по: Laskar R.C., и др.
Опубликовано: (2013-09-01) -
ATPGNN: Reconstruction of Neighborhood in Graph Neural Networks With Attention-Based Topological Patterns
по: Kehao Wang, и др.
Опубликовано: (2021-01-01) -
GRAPH NEURAL NETWORK BASED OPEN-SET DOMAIN ADAPTATION
по: S. Zhao, и др.
Опубликовано: (2022-05-01) -
Sequence-Aware Graph Neural Network Incorporating Neighborhood Information for Session-Based Recommendation
по: Liya Huang, и др.
Опубликовано: (2024-02-01)