4.7 Article

Adaptive graph convolutional collaboration networks for semi-supervised classification

期刊

INFORMATION SCIENCES
卷 611, 期 -, 页码 262-276

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2022.08.053

关键词

Graph convolutional networks; Semi-supervised classification; Oversmoothing problem; Relevance (contribution) coefficient

资金

  1. National Natural Science Foundation of China [62172177]
  2. Fundamental Research Funds for the Central Universities (HUST) [2022JYCXJJ034]
  3. Natural Science Foundation of Hubei Province [2021CFB332]
  4. Key Research and Development Program of Hubei Province [2020BAB027]
  5. Java-based Programming Curriculum Reform and Exploration Pro-ject of Ministry of Education [201901250003]
  6. Major Scientific and Technological Projects of CNPC [ZD2019-183-008]
  7. Natural Science Foundation of Shandong Province [ZR2019MF073, ZR2021MF031]
  8. Shandong Provincial Key Laboratory of Computer Network [SKLCN-2021-02]

向作者/读者索取更多资源

This paper proposes adaptive graph convolutional collaboration networks (AGCCNs) for semi-supervised classification of non-Euclidean data. AGCCNs utilize semantic information from different convolution layers and an attention mechanism to learn robust deep semantic features, addressing issues in traditional GCNs and achieving superior results compared to traditional GCNs in experimental evaluations.
Graph convolution networks (GCNs) have achieved remarkable success in processing non-Euclidean data. GCNs update the feature representations of each sample by aggregating the structure information from K-order (layer) neighborhood samples. Existing GCNs variants rely heavily on the K-th layer semantic information with K-order neighborhood informa-tion aggregating. However, semantic features from different convolution layers have dis-tinct sample attributes. The single-layer semantic feature is only a one-sided feature representation. Besides, the semantic features of traditional GCNs will be oversmoothing with multi-layer structure information aggregates. In this paper, to solve the above -mentioned problem, we propose adaptive graph convolutional collaboration networks (AGCCNs) for the semi-supervised classification task. AGCCNs can fully use the different scales of discrimination information contained in the different convolutional layers. Specifically, AGCCNs utilize the attention mechanism to learn the relevance (contribution) coefficient of the deep semantic features from different convolution layers for the task, which aims to effectively discriminant their importance. After multiple optimizations, AGCCNs can adaptively learn the robust deep semantic features via the effective semantic fusion process between multi-layer semantic information. Compared with GCNs that only utilize the K-th layer semantic features, AGCCNs make the learned deep semantic features contain richer and more robust semantic information. What is more, our proposed AGCCNs can aggregate the appropriate K-order neighborhood information for each sample, which can relieve the oversmoothing issue of traditional GCNs and better generalize shallow GCNs to more deep layers. Abundant experimental results on several popular datasets demonstrate the superiority of our proposed AGCCNs compared with traditional GCNs. (c) 2022 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据