Graph Neural Networks (GNNs) are state-of-the-art models for performing prediction tasks on graphs. While existing GNNs have shown great performance on various tasks related to graphs, little attention has been paid to the scenario where out-of-distribution (OOD) nodes exist in the graph during training and inference. Borrowing the concept from CV and NLP, we define OOD nodes as nodes with labels unseen from the training set. Since a lot of networks are automatically constructed by programs, real-world graphs are often noisy and may contain nodes from unknown distributions. In this work, we define the problem of graph learning with out-of-distribution nodes. Specifically, we aim to accomplish two tasks: 1) detect nodes which do not belong to the known distribution and 2) classify the remaining nodes to be one of the known classes. We demonstrate that the connection patterns in graphs are informative for outlier detection, and propose Out-of-Distribution Graph Attention Network (OODGAT), a novel GNN model which explicitly models the interaction between different kinds of nodes and separate inliers from outliers during feature propagation. Extensive experiments show that OODGAT outperforms existing outlier detection methods by a large margin, while being better or comparable in terms of in-distribution classification.

用于图的预测任务的最先进模型为图神经网络 (GNNs)。本文主要研究在训练和推理期间出现了未在训练集中出现的节点的情况下，存在于图中的 out-of-distribution (OOD) 节点。我们提出了 Out-of-Distribution Graph Attention Network (OODGAT)，作为一种新颖的 GNN 模型，通过显式地模型化节点之间的交互，将异常值与正常值分离开来，从而优于现有的异常值检测方法并在内部分布分类方面更好或与之媲美。

带有非分布节点的图学习