摘要
Graph convolutional networks(GCNs)have been successfully applied to node representation learning in various real-world applications.However,the performance of GCNs drops rapidly when the labeled data are severely scarce,and the node features are prone to being indistinguishable with stacking more layers,causing over-fitting and over-smoothing problems.In this paper,we propose a simple yet effective contrastive semantic calibration for graph convolution network(CSC-GCN),which integrates stochastic identity aggregation and semantic calibration to overcome these weaknesses.The basic idea is the node features obtained from different aggregation operations should be similar.Toward that end,identity aggregation is utilized to extract semantic features from labeled nodes,while stochastic label noise is adopted to alleviate the over-fitting problem.Then,contrastive learning is employed to improve the discriminative ability of the node features,and the features from different aggregation operations are calibrated according to the class center similarity.In this way,the similarity between unlabeled features and labeled ones from the same class is enhanced while effectively reducing the over-smoothing problem.Experimental results on eight popular datasets show that the proposed CSC-GCN outperforms state-ofthe-art methods on various classification tasks.
基金
supported by Joint Fund of Ministry of Education of China(8091B022149)
Key Research and Development Program of Shaanxi(2021ZDLGY01-03)
National Natural Science Foundation of China(62132016,62171343,62071361 and 62201436)
Fundamental Research Funds for the Central Universities(ZDRC2102 and ZYTS23135).