The high cost of data labeling often results in node label shortage in real applications. To improve node classification accuracy, graph-based semi-supervised learning leverages the ample unlabeled nodes to train together with the scarce available labeled nodes. However, most existing methods require the information of all nodes, including those to be predicted, during model training, which is not practical for dynamic graphs with newly added nodes. To address this issue, an adversarially regularized graph attention model is proposed to classify newly added nodes in a partially labeled graph. An attention-based aggregator is designed to generate the representation of a node by aggregating information from its neighboring nodes, thus naturally generalizing to previously unseen nodes. In addition, adversarial training is employed to improve the model's robustness and generalization ability by enforcing node representations to match a prior distribution. Experiments on real-world datasets demonstrate the effectiveness of the proposed method in comparison with the state-of-the-art methods. The code is available at https://github.com/JiarenX/AGAIN.
翻译:数据标签的高成本往往导致实际应用中的节点标签短缺。 为提高节点分类准确性,基于图形的半监督半监督学习利用大量未贴标签的节点与稀缺的标签节点一起培训。然而,大多数现有方法要求在模型培训期间提供所有节点的信息,包括有待预测的节点,而对于新添加节点的动态图来说,这种培训是不切实际的。为解决这一问题,建议采用对抗性常规图形关注模式,将新添加的节点分类为部分标签的图表。基于关注的分类器设计了一种节点的表示方式,通过汇总其邻近节点的信息,从而自然地将信息归纳到先前看不见的节点。此外,还采用对抗性培训,通过执行节点表达来提高模式的稳健性和概括能力,与先前的分布相匹配。 真实世界数据集实验表明拟议方法与最新技术方法相比的有效性。该代码可在https://github.com/JiarenX/AGAGAINAGINAINA中查阅。</s>