arrow
返回

DigGCN: Learning Compact Graph Convolutional Networks via Diffusion Aggregation

delete2022-02-01
delete11
PRE
AI
M
Minglong Lei
P
Pei Quan
马荣荣 封面图
马荣荣 (Rongrong Ma)
Y
Yong Shi
L
Lingfeng Niu *
DOI:10.1109/TCYB.2020.2988791delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Recent interests in graph neural networks (GNNs) have received increasing concerns due to their superior ability in the network embedding field. The GNNs typically follow a message passing scheme and represent nodes by aggregating features from neighbors. However, the current aggregation methods assume that the network structure is static and define the local receptive fields under visible connections, which consequently fails to consider latent or high-order structures. Besides, the aggregation methods are known to have a depth dilemma due to the over-smoothness issues. To solve the above shortcomings, we present in this article a compact graph convolutional network framework which defines the graph receptive fields based on diffusion paths and explicitly compresses the neural networks with sparsity regularization. The proposed model seeks to learn from invisible connections and recover the latent proximity. First, we infer the high-order proximity and construct diffusion paths by diffusion samplings. Compared with random walk samplings, the diffusion samplings are based on regions instead of paths. The network inference then obtains accurate weights that can be leveraged to build small but informative receptive fields with salient neighbors. Second, to utilize the deep information while avoiding overfitting, we propose learning a lightweight model by introducing a nonconvex regularizer. Numerical comparisons with the existing network embedding methods under unsupervised feature learning and supervised classification show the effectiveness of our model.
Keyword:
Neural networks
Feature extraction
Laplace equations
Diffusion processes
Training
Cybernetics
Numerical models
Diffusion process
graph convolutional networks (GCNs)
network embedding
sparsity regularization
AI总结

AI总结

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

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

U
university of chinese academy of sciences, cas
学者数:
4.1W
论文数: 3.8W
被引数: 75
B
Beijing University of Technology
学者数:
2.8W
论文数: 2.1W
被引数: 2.7W
C
chinese academy of sciences
学者数:
56.7W
论文数: 45.0W
被引数: 704
学者 查看更多机构
引用论文

引用论文

Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
err2018-10-24
err0
errOAAI
errAbdulnasser Hatemi‐J; Chi‐Chuan Lee; Chien‐Chiang Lee; Rangan Gupta
err分享
err收藏
Transformed l1 regularization for learning sparse deep neural networks
err2019-11-01
err77
PREAI
errMa, Rongrong; Miao, Jianyu; Niu, Lingfeng; Zhang, Peng
err分享
err收藏
Xbox 360 Hoaxes, Social Engineering, and Gamertag Exploits
err2013-01-01
err0
PREAI
errAshley Podhradsky; Rob DOvidio; Pat Engebretson; Cindy Casey
err分享
err收藏
Diffusion network embedding
err2019-04-01
err23
PREAI
errShi, Yong; Lei, Minglong; Yang, Hong; Niu, Lingfeng
err分享
err收藏
Spectral Analysis of Epidemic Thresholds of Temporal Networks
err2020-05-01
err36
PREAI
errZhang, Yi-Qing; Li, Xiang; Vasilakos, Athanasios V.
err分享
err收藏
Maximizing the Electromagnetic Efficiency of Spintronic Terahertz Emitters
err2024-11-03
err0
errOAAI
errPierre Koleják; Geoffrey Lezier; Daniel Vala; Baptiste Mathmann; Lukáš Halagačka; Zuzana Gelnárová; Yannick Dusch; Jean‐François Lampin; Nicolas Tiercelin; Kamil Postava; Mathias Vanwolleghem
err分享
err收藏
学者 查看更多内容