Attributed networks nowadays are ubiquitous in a myriad of high-impact applications, such as social network analysis, financial fraud detection, and drug discovery. As a central analytical task on attributed networks, node classification has received much attention in the research community. In real-world attributed networks, a large portion of node classes only contain limited labeled instances, rendering a long-tail node class distribution. Existing node classification algorithms are unequipped to handle the \textit{few-shot} node classes. As a remedy, few-shot learning has attracted a surge of attention in the research community. Yet, few-shot node classification remains a challenging problem as we need to address the following questions: (i) How to extract meta-knowledge from an attributed network for few-shot node classification? (ii) How to identify the informativeness of each labeled instance for building a robust and effective model? To answer these questions, in this paper, we propose a graph meta-learning framework -- Graph Prototypical Networks (GPN). By constructing a pool of semi-supervised node classification tasks to mimic the real test environment, GPN is able to perform \textit{meta-learning} on an attributed network and derive a highly generalizable model for handling the target classification task. Extensive experiments demonstrate the superior capability of GPN in few-shot node classification.
翻译:目前,许多影响大的应用,如社会网络分析、金融欺诈检测和毒品发现等,都普遍存在于当今的特有网络中。作为对社会网络的中央分析任务,节点分类在研究界受到重视。在现实世界的分级网络中,很大一部分节点类只包含有限的标签实例,进行长尾节点分类分布。现有的节点分类算法没有处理\ textit{few-shot}节点类的设备。作为一种补救措施,微小的学习吸引了研究界的注意力。然而,少发节点分类仍是一个具有挑战性的问题,因为我们需要解决以下问题:(一) 如何从一个分级网络中提取关于少发节点分类的元知识? (二) 如何确定每个分级实例的信息性有限,以构建一个强大有效的模型? 为了回答这些问题,我们在本文件中提议了一个图表式的元学习框架 -- -- Greaph Protocl 网络(GPN) -- -- 在模拟的节点分类中构建一个半超过节点分类任务库,以便模拟真实测试环境的高级测试能力。