2019
DOI: 10.1609/aaai.v33i01.33015829
|View full text |Cite
|
Sign up to set email alerts
|

Bayesian Graph Convolutional Neural Networks for Semi-Supervised Classification

Abstract: Recently, techniques for applying convolutional neural networks to graph-structured data have emerged. Graph convolutional neural networks (GCNNs) have been used to address node and graph classification and matrix completion. Although the performance has been impressive, the current implementations have limited capability to incorporate uncertainty in the graph structure. Almost all GCNNs process a graph as though it is a ground-truth depiction of the relationship between nodes, but often the graphs employed i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
105
0
1

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
3
3

Relationship

2
8

Authors

Journals

citations
Cited by 153 publications
(106 citation statements)
references
References 14 publications
0
105
0
1
Order By: Relevance
“…MoNet [38] shows that various non-Euclidean CNN methods including GCN are its particular instances. Other related works include GraphSAGE [25], graph attention networks [51], attention-based graph neural network [47], graph partition neural networks [36], FastGCN [16], dual graph convolutional neural network [65], stochastic GCN [17], Bayesian GCN [58], deep graph infomax [50], Lanc-zosNet [37], etc. We refer readers to two comprehensive surveys [60,62] for more discussions.…”
Section: Related Workmentioning
confidence: 99%
“…MoNet [38] shows that various non-Euclidean CNN methods including GCN are its particular instances. Other related works include GraphSAGE [25], graph attention networks [51], attention-based graph neural network [47], graph partition neural networks [36], FastGCN [16], dual graph convolutional neural network [65], stochastic GCN [17], Bayesian GCN [58], deep graph infomax [50], Lanc-zosNet [37], etc. We refer readers to two comprehensive surveys [60,62] for more discussions.…”
Section: Related Workmentioning
confidence: 99%
“…Early works [18]- [20] used label propagation and random walks on the user-item interaction graph to derive similarity scores for user-item pairs. With the emerging field in Graph Neural Networks (GNNs) [21]- [24], more recent works have started to apply graph neural networks [11], [12], [25]. Graph Convolutional Matrix Completion (GCMC) [25] treats the recommendation problem as a matrix completion task and employs a graph convolution autoencoder.…”
Section: B Graph-based Recommendationmentioning
confidence: 99%
“…图对抗攻击对原始图的结构或节点特征进行轻微扰动, 以改变网络对特定节点的预测 (参见文 献 [79]). 在对抗防御方面, Bayes 图卷积网络 [80] 通过将观测到的图看作一族含参随机图的实现, 提升 了神经网络在攻击下的鲁棒性. 目前这一领域已有一些研究工作 (参见文献 [79,81,82]), 但仍有待进 一步探索.…”
Section: 图对抗攻防unclassified