arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1910.07567cs.LGstat.ML
收藏

基于节点特征传播的图神经网络主动学习

Active Learning for Graph Neural Networks via Node Feature Propagation

Carnegie Mellon University(卡内基梅隆大学)

Yuexin Wu, Yichong Xu, Aarti Singh, Yiming Yang, Artur Dubrawski

摘要:

用于节点分类或边预测等预测任务的图神经网络(GNN)在最近的图形结构数据机器学习中受到越来越多的关注。然而,大量的标记图是很难获得的,这大大限制了GNN的真正成功。虽然主动学习已经被广泛研究用于解决其他数据类型(如文本、图像等)的标签稀疏问题,如何使它在图上有效是一个有待研究的问题。在本文中,我们提出了一个调查的主动学习与GNNs的节点分类任务。具体来说,我们提出了一种新的方法,它使用节点的特征传播,然后在主动学习的实例选择的节点的K-Medoids聚类。理论界分析,我们证明我们的方法的设计选择。在四个基准数据集上的实验中,该方法的性能始终显著优于其他代表性的基线方法。

英文摘要:

Graph Neural Networks (GNNs) for prediction tasks like node classification or edge prediction have received increasing attention in recent machine learning from graphically structured data. However, a large quantity of labeled graphs is difficult to obtain, which significantly limits the true success of GNNs. Although active learning has been widely studied for addressing label-sparse issues with other data types like text, images, etc., how to make it effective over graphs is an open question for research. In this paper, we present an investigation on active learning with GNNs for node classification tasks. Specifically, we propose a new method, which uses node feature propagation followed by K-Medoids clustering of the nodes for instance selection in active learning. With a theoretical bound analysis we justify the design choice of our approach. In our experiments on four benchmark datasets, the proposed method outperforms other representative baseline methods consistently and significantly.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑