arrow
Return

DigGCN: Learning Compact Graph Convolutional Networks via Diffusion Aggregation

delete2022-02-01
delete11
PRE
AI
M
Minglong Lei
P
Pei Quan
马荣荣 cover
马荣荣 (Rongrong Ma)
Y
Yong Shi
L
Lingfeng Niu *
DOI:10.1109/TCYB.2020.2988791delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Neural networks
Feature extraction
Laplace equations
Diffusion processes
Training
Cybernetics
Numerical models
Diffusion process
graph convolutional networks (GCNs)
network embedding
sparsity regularization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Cybernetics cover
IEEE Transactions on Cybernetics
IF:
10.5
Papers:
1.1W
Citations:
5.0W

Organization

U
university of chinese academy of sciences, cas
Scholars:
4.1W
Papers: 3.8W
Citations: 75
B
Beijing University of Technology
Scholars:
2.8W
Papers: 2.1W
Citations: 2.7W
C
chinese academy of sciences
Scholars:
56.7W
Papers: 45.0W
Citations: 704
researcher View more organizations
Cited Papers

Cited Papers

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
errShare
errSave
Transformed l1 regularization for learning sparse deep neural networks
err2019-11-01
err77
PREAI
errMa, Rongrong; Miao, Jianyu; Niu, Lingfeng; Zhang, Peng
errShare
errSave
Xbox 360 Hoaxes, Social Engineering, and Gamertag Exploits
err2013-01-01
err0
PREAI
errAshley Podhradsky; Rob DOvidio; Pat Engebretson; Cindy Casey
errShare
errSave
Optimal Control of Epidemic Information Dissemination Over Networks
err2014-12-01
err72
PREAI
errChen, Pin-Yu; Cheng, Shin-Ming; Chen, Kwang-Cheng
errShare
errSave
Diffusion network embedding
err2019-04-01
err23
PREAI
errShi, Yong; Lei, Minglong; Yang, Hong; Niu, Lingfeng
errShare
errSave
Spectral Analysis of Epidemic Thresholds of Temporal Networks
err2020-05-01
err36
PREAI
errZhang, Yi-Qing; Li, Xiang; Vasilakos, Athanasios V.
errShare
errSave
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
errShare
errSave
researcher View more