This is the source code of WSDM'23 paper "GOOD-D: On Unsupervised Graph Out-Of-Distribution Detection".

This code requires the following:

• Python==3.9
• Pytorch==1.11.0
• Pytorch Geometric==2.0.4
• Numpy==1.21.2
• Scikit-learn==1.0.2
• OGB==1.3.3
• NetworkX==2.7.1
• FAISS-GPU==1.7.2

Just run the script corresponding to the experiment and dataset you want. For instance:

• Run out-of-distribution detection on BZR (ID) and COX2 (OOD) datasets:

bash script/oodd_BZR+COX2.sh

• Run anomaly detection on PROTEINS_full datasets:

bash script/ad_PROTEINS_full.sh

The statistic of each dataset pair in our benchmark is provided as follows.

The statistic of each dataset in the anomaly detection experiments is provided as follows.

For the sake of efficiency, we set the structural encoding dimensions $d_s^{(rw)}$ and $d_s^{(dg)}$ to $16$. The encoders are 5-layer GINs with $16$ hidden dimensions. The number of dimensions of projected embeddings is the same as which of node embeddings. The batch size is selected from $16$ to $128$ according to the graph size of datasets. The number of clusters $K$ and self-adaptiveness parameter $\alpha$ are selected through grid search, with the scopes of ${2, 3, 5, 10, 15, 20, 30}$ and ${0, 0.2, 0.4, 0.6, 0.8, 1.0}$, respectively. The model is trained by the Adam optimizer with a learning rate of $0.0001$ until converging.

We conduct the experiments on a Linux server with an Intel Xeon Gold 6226R CPU and two Tesla V100S GPUs. We implement our method with PyTorch 1.11.0 and Pytorch Geometric 2.0.4.

If you compare with, build on, or use aspects of this work, please cite the following:

@inproceedings{liu2023goodd,
  title={GOOD-D: On Unsupervised Graph Out-Of-Distribution Detection},
  author={Liu, Yixin and Ding, Kaize and Liu, Huan and Pan, Shirui},
  booktitle={Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining},
  year={2023}
}