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...
Main Authors: | Saha, A, Mendez, O, Russell, C, Bowden, R |
---|---|
Format: | Conference item |
Language: | English |
Published: |
IEEE
2024
|
Similar Items
-
Graph Convolutional Network with Adaptive Fusion of Neighborhood Aggregation and Interaction
by: FU Kun, ZHUO Jiaming, GUO Yunpeng, LI Jianing, LIU Qi
Published: (2023-02-01) -
Path-Neighborhood Graphs
by: Laskar R.C., et al.
Published: (2013-09-01) -
ATPGNN: Reconstruction of Neighborhood in Graph Neural Networks With Attention-Based Topological Patterns
by: Kehao Wang, et al.
Published: (2021-01-01) -
GRAPH NEURAL NETWORK BASED OPEN-SET DOMAIN ADAPTATION
by: S. Zhao, et al.
Published: (2022-05-01) -
Sequence-Aware Graph Neural Network Incorporating Neighborhood Information for Session-Based Recommendation
by: Liya Huang, et al.
Published: (2024-02-01)