- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates unsupervised multi-relational graph anomaly detection and proposes an architecture-agnostic, plug-and-play method RelIn-GAD. RelIn-GAD iteratively aggregates relation-wise reconstruction evidence by global-to-local relation weighting and distinguishes anomaly-related disparities via a dual-inconsistency mechanism. Extensive experiments show the effectiveness and the generalization of RelIn-GAD on multiple datasets.
Critical strengths
(1) The proposed method RelIn-GAD is an plug-and-play module, which can be easily integrated into other baselines and achieves consistent improvements.
(2) The motivations of most modules are reasonable, especially the inconsistency measurement and mathematical formulation of the modules.
(3) The paper is well-writen and easy to follow.
Critical weaknesses
(1) The ablation study (Table 3) cannot illustrate the effectiveness of each module. On most of dataset in Table 3 (except Amazon), the removal of each module has no significant performance drop.
(2) In Table 1 and 2, I discover AUROC of many baselines on several datasets are below 50%. A random baseline should be 50%. Is there any experiment fault in these two tables?
Questions for authors
See weaknesses.
Other questions:
(1) The recent baselines UMGAD and SFGA are both the multi-relational GAD baselines. What are the technical differences between these baselines and the proposed method?
(2) In my opinion, multi-relational graph is one category of the heterogenous graph with just one kind of nodes. Is there any heterogenous GAD method which can serve as the baselines?
4 comments
Q2. Additional heterogeneous graph anomaly detection baselines
R4. We thank the reviewer for this valuable suggestion. Multi-relation graphs can be viewed as a special case of heterogeneous graphs with a shared node set and multiple relation types. However, relatively few studies specifically address unsupervised node-level anomaly detection in heterogeneous graphs, and the official implementation of a recent unsupervised heterogeneous graph anomaly detection work, HINAno [3], is not publicly available. Therefore, we additionally adapt two recent self-supervised heterogeneous graph learning methods with publicly available implementations, MUG [4] and MVMAE [5], for comparison. Both methods are adapted to our multi-relation setting by preserving relation-specific graph views and introducing reconstruction-based node-level anomaly scoring.
Table I: Comparison with adapted heterogeneous graph methods (AUROC / AUPRC, %).
| Method | Amazon | YelpChi | S-FFSD | IEEE-CIS |
|---|---|---|---|---|
| MUG | 74.11 / 19.43 | 51.15 / 15.94 | 56.97 / 25.04 | 54.26 / 15.43 |
| MVMAE | 51.87 / 6.84 | 49.26 / 13.92 | 31.90 / 13.48 | 57.28 / 10.32 |
| RelIn-GAD | 88.41 / 36.66 | 62.69 / 24.15 | 64.75 / 29.49 | 69.33 / 18.91 |
As shown in Table I, our evaluation extends to recent heterogeneous graph representation learning methods adapted for unsupervised anomaly detection. They reflect our added reconstruction-based scoring adaptations, rather than anomaly detection results originally reported by those papers. Unlike these adapted methods, RelIn-GAD models both structural and reconstruction-level inconsistencies during training, while using gated structural inconsistency as complementary evidence for inference scoring. We have referenced the supplementary comparison in Sec. 4.1 (Line 338) and added the adapted heterogeneous graph learning baselines and experimental results in Appendix D (Line 879) of the revised manuscript.
[3] Xiangjie Kong, Siyue Shuai, Hui Wang, Guojiang Shen, Feng Xia, Dual-View Anomaly Detection in Heterogeneous Information Networks with Hierarchical Neighborhood Fusion. ACM TKDD 2025.
[4] Lianze Shan, Jitao Zhao, Dongxiao He, Yongqi Huang, Zhiyong Feng, Weixiong Zhang, MUG: Meta-path-aware Universal Heterogeneous Graph Pre-Training. AAAI 2026.
[5] Hao Geng, Deqing Wang, Lihao Ge, Chenguang Du, Fuzhen Zhuang, Bowen Yang, Efficient and Scalable Multiview Masked Autoencoder for Heterogeneous Graph Self-Supervised Learning. IEEE TNNLS 2026.
Thank the authors for their response, which has addressed my concern to some extent. However, the innovations proposed in this paper are not particularly compelling to me, so I will maintain my original score.
Dear Reviewer KY2a,
We sincerely thank you for your time and thoughtful consideration of our response. We appreciate your acknowledgment that our clarifications have addressed some of your concerns.
While we respect your assessment, we would like to briefly reiterate two key aspects of our novelty and contributions:
-
Relation Inconsistency Modeling: Unlike UMGAD and SFGA, which primarily focus on contrastive learning and cross-relation representation fusion, respectively, RelIn-GAD explicitly models two complementary forms of cross-relation inconsistency (structural and reconstruction-based), leveraging them for node-adaptive training and gated anomaly scoring.
-
Plug-and-Play Framework: Rather than designing a standalone multi-relation detector, RelIn-GAD provides an architecture-agnostic framework that extends existing reconstruction-based single-relation GAD detectors to multi-relation settings without backbone redesign. Its effectiveness is further supported by experiments across seven backbones and additional comparisons with heterogeneous graph methods.
We would be grateful for any further guidance on your remaining reservations. In particular, it would be helpful to know whether we could better clarify the methodological distinctions from prior work or the significance of the plug-and-play framework, or whether there are other aspects that remain insufficiently addressed.
Thank you again for your valuable feedback and consideration.
Best regards, The Authors
Thank you for your constructive feedback to help improve our paper. Below, we address your concerns point by point, which has been reflected in the revised manuscript. Please kindly let us know if our response addresses your concerns.
W1. Clarification of ablation results
R1. We thank the reviewer for this observation. The contributions of individual components depend on the characteristics of cross-relation inconsistency in each dataset, rather than producing uniform gains in all settings. For example, removing explicit or implicit inconsistency leads to noticeable performance degradation on Amazon, whereas the effects are smaller on some other datasets. This is consistent with our framework's objective: exploiting informative cross-relation disparities when they are present, rather than assuming all relational differences are equally useful for anomaly detection. In particular, on IEEE-CIS, only 0.28% of nodes belong to the implicit-inconsistent category, while 74.91% are relation-consistent. Consequently, the implicit mechanism has limited influence on the overall anomaly ranking, which helps explain why its removal produces close AUROC/AUPRC values. The additional taxonomy ablation also compares degree-only, reconstruction-only, ungated dual-signal, and random-gating alternatives under matched configurations.
We have revised the ablation discussion in Sec. 4.5 (Line 451) and added further dataset-dependent analysis in Appendix H (Line 1080) of the revised manuscript.
W2. Explanation of AUROC results below 50%
R2. The reported AUROC values below 50% are valid outcomes under our evaluation protocol and do not, by themselves, indicate experimental errors. AUROC measures the probability that a randomly selected anomalous node receives a higher anomaly score than a randomly selected normal node. Therefore, while random ranking has an expected AUROC of 50%, a detector can legitimately achieve a lower value when its scoring assumptions do not align with the anomaly patterns in a particular dataset. For single-relation GAD baselines, we merge edges from different relations into a homogeneous graph, following the evaluation strategy adopted by SFGA [2]. This transformation removes relation-specific semantics and may weaken the effectiveness of detectors originally designed for homogeneous graphs. Consequently, some baselines produce anomaly rankings that are less informative than random ranking on particular datasets. We report these results as obtained, without artificially reversing anomaly scores or adjusting AUROC values to exceed 50%.
[2] Huiliang Zhai, Xiangyi Teng, Jing Liu, SFGA: Similarity-Constrained Fusion Learning for Unsupervised Anomaly Detection in Multiplex Graphs. AAAI 2026.
Q1. Technical differences from UMGAD and SFGA
R3. We kindly refer the reviewer to the detailed methodological comparison already provided in Appendix C (Line 830) of our original submission. Although all three methods address multi-relation graph anomaly detection, their core mechanisms differ. UMGAD employs graph-masked autoencoders with augmented-view contrastive learning for anomaly detection, while SFGA focuses on cross-relation attention and similarity-constrained representation learning. In contrast, RelIn-GAD explicitly distinguishes structural and reconstruction-level inconsistencies, incorporating both into node-adaptive training while using gated structural inconsistency for inference correction. Furthermore, unlike these standalone architectures, RelIn-GAD provides a plug-and-play enhancement for existing reconstruction-based detectors. We have further added a brief clarification of these technical distinctions in Sec. 4.4 (Line 428) of the revised manuscript.