用部分标签学习提升噪声节点分类准确率
PaSta: Noisy Node Classification with Partial Label Learning

- 通过多标注器生成高质量部分标签,避免单标签过拟合
- 在五大数据集上比现有方法平均提升1.1%准确率
- 适合处理弱监督下的图数据噪声问题
噪声节点分类是真实世界图相关网络服务中的基础但具挑战性任务,因弱监督或自动标注导致节点标签常被污染。现有方法多基于独热标签训练,易对噪声标签过拟合,并在伪标签增强后引发误差累积。本文提出一种基于部分标签的自训练框架PaSta,首先训练多个标注器以全面捕捉节点类别分布,并聚合其预测构建高质量部分标签;随后设计双损失函数的分类模型,在标签空间与表示空间协同优化;为进一步提升抗噪能力,引入闭环迭代自训练策略,用部分标签学习优化标注器。在五个数据集上的大量实验表明,相比现有最优方法,PaSta在多种噪声设置下平均提升1.1%分类性能。
原文摘要 · Abstract (English)
Noisy node classification problem is a fundamental yet challenging task for real-world graph-related web services, where node labels are often corrupted or unreliable due to weak supervision or automatic annotation. However, existing methods typically train models based on one-hot labels, which not only makes models susceptible to overfitting on noisy labels, but also leads to error accumulation after pseudo-label-guided enhancement. In this paper, we propose a novel Partial label-based Self-training framework (PaSta for short) that leverages partial label learning technique to overcome the limitations of existing methods. Specifically, PaSta first trains multiple annotators to comprehensively capture the class distribution of nodes and aggregates their predictions to construct high-quality partial labels. Subsequently, we design a partial label-based classification model with two well-crafted loss functions to guide the model learning at both label and representation spaces. To further enhance the robustness against noisy labels, we introduce a self-training strategy where the labels refined by partial label learning are then used to further optimize the annotators in a closed-loop iterative manner. Extensive experiments on five datasets demonstrate that, compared with existing state-of-the-art methods, PaSta achieves an average improvement of 1.1% in classification performance under various noise settings.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。