Deep Graph Convolutional Neural Network based on Adaptive Sampling and Aggregation Strategy
Graph neural networks learn node embeddings by recursively sampling and aggregating nodes in a graph, while existing methods have a fixed pattern of node sampling and aggregation, and usually only consider direct neighborhood. When sampling high-order neighborhood, it is easy to produce over-smoothing, which affects the model performance and accuracy. Therefore, this paper proposes an adaptive sampling and aggregation deep graph convolutional network (Adaptive Sampling and Aggregation Depth Graph Convolutional Network, ASA-GCN). A sampling strategy based on node importance is designed to adaptively sample high-order neighbors of nodes. Meanwhile, an aggregation strategy based on self-attention mechanism is proposed to adaptively aggregate node information within a given neighborhood. Finally, experimental results on multiple benchmark graph datasets show that the model has superior performance on the node classification task.
Authors
- Zhonglin Ye (ORCID: https://orcid.org/0000-0002-2429-3325)
- Lin Zhou (ORCID: https://orcid.org/0000-0002-5137-7858)
- Wei Zhang (ORCID: https://orcid.org/0009-0000-9306-8116)
- Xueli Wang (ORCID: https://orcid.org/0000-0002-8382-9425)
- Gege Li (ORCID: https://orcid.org/0000-0001-8431-8806)
- Hongkai Liu (ORCID: https://orcid.org/0000-0002-9322-7487)
Institutions
- Qinghai Normal University (CN)
Publication Details
- Published
- 2024-09-13
- DOI
- https://doi.org/10.1109/mvipit65697.2024.00044
- Primary Topic
- Text and Document Classification Technologies
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Cooperation Program of Qinghai Province