Out-of-Distribution Node Detection Based on Graph Heat Kernel Diffusion

Fangfang Li (), Yangshuai Wang, Xinyu Du, Xiaohua Li and Ge Yu
Additional contact information
Fangfang Li: School of Computer Science and Engineering, Northeastern University, Shenyang 110169, China
Yangshuai Wang: School of Computer Science and Engineering, Northeastern University, Shenyang 110169, China
Xinyu Du: School of Computer Science and Engineering, Northeastern University, Shenyang 110169, China
Xiaohua Li: School of Computer Science and Engineering, Northeastern University, Shenyang 110169, China
Ge Yu: School of Computer Science and Engineering, Northeastern University, Shenyang 110169, China

Mathematics, 2024, vol. 12, issue 18, 1-16

Abstract: Over the past few years, there has been a surge in research attention towards tasks involving graph data, largely due to the impressive performance demonstrated by graph neural networks (GNNs) in handling such information. Currently, out-of-distribution (OOD) detection in graphs is a hot research topic. The goal of graph OOD detection is to identify nodes or new graphs that differ from the training data distribution, primarily in terms of attributes and structures. OOD detection is crucial for enhancing the stability, security, and robustness of models. In various applications, such as biological networks and financial fraud, graph OOD detection can help models identify anomalies or unforeseen situations, thereby enabling appropriate responses. In node-level OOD detection, existing models typically only consider first-order neighbors. This paper introduces graph diffusion to the OOD detection task for the first time, proposing the HOOD model, a graph diffusion-based OOD node detection algorithm. Specifically, the original graph is processed through graph diffusion to obtain a new graph that can directly capture high-order neighbor information, overcoming the limitation that message passing must go through first-order neighbors. The new graph is then sparsified using a top-k approach. Based on entropy information, regularization is employed to ensure the uncertainty of OOD nodes, thereby giving these nodes higher scores and enabling the model to effectively detect OOD nodes while ensuring the accuracy of in-distribution node classification. Experimental results demonstrate that the HOOD model outperforms existing methods in both node classification and OOD detection tasks on multiple benchmarks, highlighting its robustness and effectiveness.

Keywords: out-of-distribution; graph diffusion; regularization; graph neural network (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/18/2942/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/18/2942/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:18:p:2942-:d:1482787

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().