RRLFSOR: An Efficient Self-Supervised Learning Strategy of Graph Convolutional Networks
원문 초록
Graph Convolutional Networks (GCNs) are widely used in many applications yet still need large amounts of labelled data for training. Besides, the adjacency matrix of GCNs is stable, which makes the data processing strategy cannot efficiently adjust the quantity of training data from the built graph structures.To further improve the performance and the self-learning ability of GCNs,in this paper, we propose an efficient self-supervised learning strategy of GCNs,named randomly removed links with a fixed step at one region (RRLFSOR).RRLFSOR can be regarded as a new data augmenter to improve over-smoothing.RRLFSOR is examined on two efficient and representative GCN models with three public citation network datasets-Cora,PubMed,and Citeseer.Experiments on transductive link prediction tasks show that our strategy outperforms the baseline models consistently by up to 21.34% in terms of accuracy on three benchmark datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Hierarchical Vector Quantized Graph Autoencoder with Annealing-Based Code Selection
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Graph Collaborative Attention Network for Link Prediction in Knowledge Graphs
RetFiner: A Vision-Language Refinement Scheme for Retinal Foundation Models
Boosting Generative Adversarial Transferability with Self-supervised Vision Transformer Features
Post-training for Deepfake Speech Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.