Skip to content
Book Open access

Rethinking Generalization in Graphs: A Hierarchical Interaction Perspective for Generalist Detection

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 6806-6816 · 0 citations · 31 references

TL;DR

Hierarchical Interaction MOdeling for zero-shot generalist GAD enables anomaly detection across diverse graph domains without retraining or access to target-domain supervision by modeling the evolutionary trajectories of node representations across hierarchical structural depths, thereby capturing interaction patterns that exhibit strong cross-domain stability.

Abstract

With the increasing heterogeneity of social networks and online interaction systems, generalist graph anomaly detection (GAD) has become essential for identifying abnormal and fraudulent behaviors in complex environments. However, most existing GAD approaches rely heavily on domain-specific semantic alignment, which substantially restricts their ability to learn transferable node representations and often leads to poor generalization on unseen graph domains. To address this challenge, we propose HIerarchical Interaction MOdeling for zero-shot generalist GAD (termed HIMO-GAD). HIMO-GAD enables anomaly detection across diverse graph domains without retraining or access to target-domain supervision by modeling the evolutionary trajectories of node representations across hierarchical structural depths, thereby capturing interaction patterns that exhibit strong cross-domain stability. Specifically, HIMO-GAD integrates two core components: (1) a Dynamic Interaction Modeling Module that characterizes cross-layer interaction evolution to extract transferable representations, and (2) an Anomaly-Aware Regulation Mechanism that combines gradient immunity and centralization regularization to suppress overfitting and stabilize cross-domain generalization. Extensive experiments on multiple real-world graph datasets demonstrate that HIMO-GAD consistently outperforms state-of-the-art baselines in strict zero-shot settings, achieving up to a 10% improvement in key evaluation metrics and exhibiting strong generalization across heterogeneous graph domains.

Read PDF

Similar papers

Conference Open access Sep 2026

HGOOD: Hypergraph-enhanced Graph Contrastive Learning for Graph Out-of-Distribution Detection

A Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of-Distribution detection (termed HGOOD), which constructs two branches to hierarchically mine graph compact semantics in a comprehensive manner and introduces a cross-branch prototype contrast that aligns the captured graph patterns with their cr...

Xuan-Ting Fan, Chen-Yu Wang, Yue-Yue Gao et al. · 0 citations
#machine learning Preprint Oct 2026

Differentiable Koopman Operator for Contrastive Learning on Dynamic Graphs

Real-world interaction networks are inherently dynamic: edges form and dissolve as node behavior shifts over time. Most snapshot-based contrastive methods encode temporal dependencies implicitly in encoder weights, without an explicit model of how node representations evolve, making them brittle under distribution shif...

Md Abrar Jahin, Taufikur Rahman Fuad, Md. Rizwan Parvez · 0 citations

An Integration of Fuzzy-Enhanced Heterophilic Graph Representation Learning for Improving Performance of Link Prediction

Extensive experiments ensure that FHGE consistently outperforms state-of-the-art baselines and demonstrate the power of fuzzy-driven learning in improving graph embedding quality and establish FHGE as a promising solution for real-world link prediction tasks.

Linh Nguyen Thi My, Tham Vo · 5 citations
Sep 2026

Semantic-Aware Heterogeneous Graph Learning for Fake News Detection.

Experimental results on real-world datasets demonstrate that SHEAR significantly outperforms existing methods in fake news detection, showcasing the benefits of incorporating behavioral semantic patterns with network motifs for enhanced classification performance.

Shuo Yu, Yu-Peng Gao, Jing Ren et al. · 0 citations
Open access Oct 2026

Decoupled Feature Propagation and Structural Boosting: A Robust Framework for Node Classification on Heterophilous Graphs

Standard Graph Neural Networks (GNNs) frequently struggle with heterophilous structures where local proximity does not imply label similarity, leading to significant performance degradation due to signal oversmoothing. This study aimed to bridge the gap between theoretical complexity and empirical reliability by propos...

Heru Ismanto, I. Wayangkau · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.