返回
Poisson kernel: Avoiding self-smoothing in graph convolutional networks
DOI:10.1016/j.patcog.2021.108443.png)
摘要
En 中文
Graph convolutional network is now an effective tool to deal with non-Euclidean data, such as social behavior analysis, molecular structure analysis, and skeleton-based action recognition. Graph convolutional kernel is one of the most significant factors in graph convolutional networks to extract nodes' feature, and some variants of it have achieved highly satisfactory performance theoretically and experimentally. However, there was limited research about how exactly different graph structures influence the performance of these kernels. Some existing methods used an adaptive convolutional kernel to deal with a given graph structure, which still not explore the internal reasons. In this paper, we start from theoretical analysis of the spectral graph and study the properties of existing graph convolutional kernels, revealing the selfsmoothing phenomenon and its effect in specific structured graphs. After that, we propose the Poisson kernel that can avoid self-smoothing without training any adaptive kernel. Experimental results demonstrate that our Poisson kernel not only works well on the benchmark datasets where state-of-the-art methods work fine, but also is evidently superior to them in synthetic datasets. (c) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Graph convolutional kernel
Graph convolutional network
Graph neural network
Graph structure
Self-smoothing
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Every node counts: Self-ensembling graph convolutional networks for semi-supervised learning
PATTERN RECOGNITION
IF7.6
Coupling energy metabolism with a mechanism to support brain-derived neurotrophic factor-mediated synaptic plasticity
Neuroscience
IF0
Graph convolutional network with structure pooling and joint-wise channel attention for action recognition
PATTERN RECOGNITION
IF7.6

