arrow
返回

Graph convolutional neural networks with node transition probability-based message passing and DropNode regularization

delete2021-07-01
delete22
delete
OA
AI
T
Tien Huu *
D
Duc Minh Nguyen
G
Giannis Bekoulis
A
Adrian Munteanu
N
Nikos Deligiannis
DOI:10.1016/j.eswa.2021.114711delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Graph convolutional neural networks (GCNNs) have received much attention recently, owing to their capability in handling graph-structured data. Among the existing GCNNs, many methods can be viewed as instances of a neural message passing motif; features of nodes are passed around their neighbors, aggregated and transformed to produce better nodes' representations. Nevertheless, these methods seldom use node transition probabilities, a measure that has been found useful in exploring graphs. Furthermore, when the transition probabilities are used, their transition direction is often improperly considered in the feature aggregation step, resulting in an inefficient weighting scheme. In addition, although a great number of GCNN models with increasing level of complexity have been introduced, the GCNNs often suffer from over-fitting when being trained on small graphs. Another issue of the GCNNs is over-smoothing, which tends to make nodes' representations indistinguishable. This work presents a new method to improve the message passing process based on node transition probabilities by properly considering the transition direction, leading to a better weighting scheme in nodes' features aggregation compared to the existing counterpart. Moreover, we propose a novel regularization method termed DropNode to address the over-fitting and over-smoothing issues simultaneously. DropNode randomly discards part of a graph, thus it creates multiple deformed versions of the graph, leading to data augmentation regularization effect. Additionally, DropNode lessens the connectivity of the graph, mitigating the effect of over-smoothing in deep GCNNs. Extensive experiments on eight benchmark datasets for node and graph classification tasks demonstrate the effectiveness of the proposed methods in comparison with the state of the art.
Keyword:
Graph convolutional neural networks
Graph classification
Node classification
Geometric deep learning
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Expert Systems with Applications 封面图
Expert Systems with Applications
IF:
7.5
论文数:
3.0W
被引数:
10.2W

机构

V
Vrije Universiteit Brussel
学者数:
1.4W
论文数: 1.3W
被引数: 129
引用论文

引用论文

Choosing medical assessments: Does the multiple-choice question make the grade?
err2018-01-01
err0
PREAI
errHannah Pham; Monique Trigg; Shaopeng Wu; Alice O'Connell; Christopher Harry; John Barnard; Peter Devitt
err分享
err收藏
Graph Signal Processing: Overview, Challenges, and Applications图信号处理: 概述、挑战与应用
err2018-05-01
err1.1K
errOAAI
errOrtega, Antonio; Frossard, Pascal; Kovacevic, Jelena; Moura, Jose M. F.; Vandergheynst, Pierre
err分享
err收藏
Electron energy-loss spectrum-imaging
err1991-10-01
err0
PREAI
errJ.A. Hunt; D.B. Williams
err分享
err收藏
Quantum-chemical insights from deep tensor neural networks来自深度张量神经网络的量子化学见解
err2017-01-09
err1.1K
errOAAI
errSchuett, Kristof T.; Arbabzadah, Farhad; Chmiela, Stefan; Mueller, Klaus R.; Tkatchenko, Alexandre
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
Molecular graph convolutions: moving beyond fingerprints分子图卷积: 超越指纹
err2016-08-24
err1.1K
errOAAI
errKearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick
err分享
err收藏
没有更多内容