HGOOD-D: Hyperbolic Hierarchical Exploration for Graph Out-of-Distribution Detection
IEEE Transactions on Knowledge and Data Engineering · 2026-07 · 38 (7) · 4405-4418
DOI: 10.1109/tkde.2026.3690579 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Knowledge and Data Engineering, 2026-07. Verfasst von Yuntai Ding und 8 weiteren Autor:innen. Die Arbeit nennt 56 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities, Humanities and Social Sciences Research Fund of the Ministry of Education of China.
Abstract (Originalsprache)
Out-of-distribution (OOD) detection has garnered increasing concern for identifying test samples that exhibit a distributional shift from the training dataset in practical deep learning applications. With the significant advancements in graph deep learning for graph representation, graph OOD detection has emerged as a research problem. Graph contrastive learning (GCL) is applied to graph OOD detection due to its capacity for learning discriminative representations in a self-supervised manner, thereby eliminating the need for time-consuming and labor-intensive label information. However, existing methods often neglect the explicit consideration of underlying semantics behind graph data distribution for OOD detection. We observe that naive data augmentations in GCL may inadvertently compromise the intrinsic graph structure while retaining redundant structural information, which hinders semantic discrimination between graphs. Additionally, euclidean space embedding struggles to maintain hierarchical structural consistency, making it challenging to meaningfully capture the hierarchical semantic distribution of graph data. In response to these issues, we propose a novel framework termed HGOOD-D, which aims to explore latent semantic hierarchies in hyperbolic space for graph OOD detection. Specifically, we design a bottleneck graph extractor grounded in the information bottleneck (IB) principle, which captures the minimal sufficient information to distinguish graph patterns. Based on this, we introduce hierarchical contrastive learning to capture the hierarchical semantics within graph data distribution. These methods are based on hyperbolic space embedding that can preserve complex inter-relationships in graph hierarchies, thereby mitigating data distortion. Comprehensive evaluations on ten widely used benchmark datasets show that HGOOD-D consistently surpasses current state-of-the-art approaches in graph OOD detection.
Förderung
- National Natural Science Foundation of China
- Fundamental Research Funds for the Central Universities
- Humanities and Social Sciences Research Fund of the Ministry of Education of China
Zitieren
APA
Ding, Y., Ren, T., Fu, Y., Wang, Y., Zhang, H., Chen, C., Ju, W., Luo, X., & Hua, X. (2026). HGOOD-D: Hyperbolic Hierarchical Exploration for Graph Out-of-Distribution Detection. IEEE Transactions on Knowledge and Data Engineering, 38(7), 4405-4418. https://doi.org/10.1109/tkde.2026.3690579
Vancouver
Ding Y, Ren T, Fu Y, Wang Y, Zhang H, Chen C, et al. HGOOD-D: Hyperbolic Hierarchical Exploration for Graph Out-of-Distribution Detection. IEEE Transactions on Knowledge and Data Engineering. 2026;38(7):4405-4418. doi:10.1109/tkde.2026.3690579
BibTeX
@article{Ding2026,
author = {Ding, Yuntai and Ren, Tao and Fu, Yiwei and Wang, Yifan and Zhang, Haodong and Chen, Chong and Ju, Wei and Luo, Xiao and Hua, Xian-Sheng},
title = {HGOOD-D: Hyperbolic Hierarchical Exploration for Graph Out-of-Distribution Detection},
journal = {IEEE Transactions on Knowledge and Data Engineering},
year = {2026},
volume = {38},
number = {7},
pages = {4405--4418},
doi = {10.1109/tkde.2026.3690579}
}
EUVIMED