.png){kind=icon}
.png){kind=icon}
Return
Confidence correction for trained graph convolutional networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patcog.2024.110773.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Adopting Graph Convolutional Networks (GCNs) for transductive node classification is a hot research direction in artificial intelligence. Vanilla GCNs are primarily under-confident and struggle to clarify the final classification results explicitly due to the lack of supervision. Existing works mainly alleviated this issue by improving annotation deficiency and introducing addition regularization terms. However, these methods need to re-train the model from the beginning, which is computationally expensive for large dataset and model. To deal with this problem, a novel confidence correction mechanism (CCM) for trained GCNs is proposed in this work. Such mechanism aims at calibrating the confidence output of each node in the inference stage by jointly inferring the feature and predicted pseudo label. Specifically, in the inference stage, it uses the predicted pseudo label to select target-related features over all network to obtain a more confident and better result. Such selectivity is formulated as an optimization problem to maximize the category score of each node. In addition, the greedy optimization strategy is utilized to solve this problem and we have mathematically proven that the proposed mechanism can reach the local optimum by mathematical induction. Note that such mechanism is flexible and can be introduced to most GCN-based model. Extensive experimental results on benchmark datasets show that the proposed method can promote the confidence of the final target category and improve the performance of GCNs in the inference stage.
Keywords:
Graph convolutional network
Node classification
Under-confident
Confidence correction mechanism
Journal
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
View more organizations