- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
This paper proposes an empirical study on graph anomaly detection, which investigates the resampling technique for GAD. This paper claims several findings from an engineering perspective as its main findings, supported by evidence from evaluation metrics.
Critical strengths
- Analysing resampling in GAD is definitely an interesting and novel perspective in this field. I believe the topic is interesting in the supervised GAD and generalist GAD areas.
Critical weaknesses
-
The background is unclear. The background and motivation of this study are not well explained; usually, they are supported with only a few sentences. This makes it difficult for readers to understand why this is necessary and the importance of studying resampling.
-
This is not up-to-date research. In the related work section, it cites only 3 GAD methods. Notably, the whole related work section only cites two papers published after 2025.
-
Although the topic itself is interesting, this report does not contribute any meaningful new knowledge or insights to the GAD community. First, the investigated baselines (XGBoost and Random Forest) are peripheral and outdated in GAD research, where the mainstream focus has shifted toward graph-learning-based algorithms for many years. If these analysed techniques do not attract any research interest, why should a paper focus on conducting empirical analysis based on these dead methods? Moreover, the report is totally focused on an engineering perspective and enumerating numbers without insights. The close-up analyses are hand-waving, rather than raising any grounded recommendations or talking about something that is relevant to the GAD itself. I suggest the authors do more background research to ensure they understand what the current practices are first, before conducting any analysis.
Questions for authors
Can you re-conduct the whole analysis on recent supervised GAD baselines?
Thank you for the review. We agree with W1, W2 and the question. We disagree with W3.
W1 - Background and motivation are unclear. Agreed. §1 is rewritten. With about twenty labelled anomalies, the cheapest lever is the training set, and each resampling method is reported with its own detector, representation and split. Two gaps follow. A result obtained in one detector family (GNNs, tree ensembles, tabular foundation models) may not hold in another. And nobody had examined whether the label-free traces of injected benchmarks (degree and feature norm; Huang et al., ICDE 2023) drive the gains of supervised resampling.
W2 - Not up to date. Agreed. §2 is rewritten and broaden with tabular foundation models and recent GNNs litterature. It now covers GHRN, PMP, PC-GNN, ConsisGAD, SpaceGNN, APF, SAGAD, ChiGAD, TFM4GAD and LightGAD, recent work on imbalance (IGL-Bench, BAT, two 2026 studies) and the work on injected-anomaly leakage. The bibliography goes from 25 to 46 entries, and from 3 to 16 dated 2024-26.
W3 - XGBoost and Random Forest are "dead methods". This is incorrect.
We do not claim that trees win everywhere. The best GNN is above tuned RFGraph on five of the nine injected graphs (§4.4).
W3 - No insight, nothing relevant to GAD itself, no grounded recommendations. We disagree, three results concern GAD ecosystem directly.
§6 turns these into recommendations: tune the detector first, repeat paired labelled splits, report organic and injected anomalies separately and by type, and check the label-free degree and norm baselines.
Q - Re-conduct the analysis on recent supervised GAD baselines.