.png){kind=icon}
返回
Self-Supervised Graph Representation Learning via Topology Transformations
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2021.3133439.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present the Topology Transformation Equivariant Representation learning, a general paradigm of self-supervised learning for node representations of graph data to enable the wide applicability of Graph Convolutional Neural Networks (GCNNs). We formalize the proposed model from an information-theoretic perspective, by maximizing the mutual information between topology transformations and node representations before and after the transformations. We derive that maximizing such mutual information can be relaxed to minimizing the cross entropy between the applied topology transformation and its estimation from node representations. In particular, we seek to sample a subset of node pairs from the original graph and flip the edge connectivity between each pair to transform the graph topology. Then, we self-train a representation encoder to learn node representations by reconstructing the topology transformations from the feature representations of the original and transformed graphs. In experiments, we apply the proposed model to the downstream node classification, graph classification and link prediction tasks, and results show that the proposed method outperforms the state-of-the-art unsupervised approaches.
Keyword:
Topology
Representation learning
Network topology
Mutual information
Data models
Task analysis
Transforms
Self-supervised learning
graph representation learning
topology transformation
transformation equivariant representation
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
More tricks with tetramers: a practical guide to staining T cells with peptide–MHC multimers.png)
Immunology
OAAI
ImmunologyIF0
OAAI分享收藏Passive signal propagation and membrane properties in median photoreceptors of the giant barnacleOAAI
OAAI分享收藏分享收藏
查看更多内容