- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper attempts to solve the problem that existing graph anomaly detection algorithms often fail to recognize records with normal content that are misplaced in the graph. The authors confirm this detection blind spot through controlled experiments and propose the PlaceGuard method, which identifies misplacement anomalies through three-layer verification and achieves much better detection results than existing methods.
Critical strengths
- A new OOD detection problem scenario has been proposed, where the record content is normal but does not match the graph position.
- Through controlled experiments and theoretical analysis, it has been proven that relying solely on records or graph positions cannot identify such mismatch anomalies.
- The authors proposed a non-compensatory verification approach that requires both internal consistency and positional matching to be satisfied, avoiding high confidence in one dimension masking anomalies in another dimension.
Critical weaknesses
- All cases of record misplacement are artificially constructed and lack validation in real-world scenarios.
- The baseline methods do not use the same targeted training strategy for misplacement, which raises concerns about the fairness of the experimental comparison.
- The core design of the method combines multiple existing techniques, with limited methodological novelty.
- Detection performance remains unsatisfactory for within-class record misplacement cases.
Questions for authors
- Can artificially constructed record misplacement samples represent anomalies in real scenarios? Is there any real-world data to validate the method’s effectiveness?
- If the baseline methods are also trained with the same misplacement samples, can PlaceGuard still maintain a significant advantage?
- Compared to simple feature fusion or score weighting, does PlaceGuard’s non-compensatory verification have significant advantages?
- The detection performance of within-class record misplacement is limited and the false positive rate is high. Can this method meet practical application requirements?
We thank the reviewer for the questions on realistic errors, training fairness and practical use. AUROCs/rates are percentages. We average six graphs within each split; ± is sample SD over the three split means.
W1 & Q1 — Real errors and controlled validation. Yes. We recovered public Wikimedia Commons corrections: photographs of the U.S. Navy Commodores ensemble had been assigned to the same-named R&B band category. Editors corrected the category association while leaving the photos and descriptions unchanged (correction discussion).
These corrections document real occurrence; the reported AUROCs come from controlled reassignments on six real graphs. The controlled test changes record assignments while holding recipient contexts and the record multiset fixed (Section 5.1). It isolates whether a detector checks correspondence: record-only scores cannot detect an intact-record permutation (Proposition 1). BOND [1] likewise evaluates injected and organic outliers separately. Our control targets the distinction illustrated by the real corrections: normal content can still have an incorrect association.
W2 & Q2 — The actual baselines with the same misplaced samples. After training all seven Table 2 baselines on the same four replacement types, with identical replacement examples and donors, the best native baseline reaches 50.5±0.1 weakest-locus AUROC, versus 79.5±0.7 for revised PlaceGuard. TIDE leads on conventional semantic OOD in the same comparison (92.4 versus 91.4). We retain each native architecture and inference score, using two fixed exposure strengths, at most 120 additional epochs and patience 20. These rows select epochs on clean known validation, then exposure strength on structured validation (Appendix E.10, Table 17).
We separately align the strongest exposed baseline, TNT-OOD, with the MLP/PlaceGuard structured-validation criterion at every epoch. Its weakest AUROC rises to 51.9±0.1, leaving a paired gap of 27.6±0.7 points to revised PlaceGuard. At that same TNT checkpoint, removing propagation gives 61.4 weakest AUROC, while conventional AUROC falls from 90.7 to 67.8. Thus selection and propagation each affect the result, but neither change closes the gap.
The MLP directly learns to reject a record–recipient pairing from their separate feature vectors. The native baselines retain their own representations, objectives and scores; identical negative samples do not make them the same detector. The PlaceGuard–MLP comparison below additionally matches input features, parameter count and selection rules.
W3 & Q3 — Technical contribution, fusion and score weighting. PlaceGuard trains two distinct decisions: whether the record is internally valid and whether it fits this recipient. Clean records receive (validity, fit)=(1,1), intact misplaced records (1,0), and one-modality replacements (0,0). The validity head sees the record alone; the fit head also sees its interactions with known neighbors. These labels distinguish normal-but-misassigned content from corrupt content (Section 4.3).
For supports in [0,1], the submitted product is bounded by each support, so a strong check cannot cancel a weak one. With the same heads, clean calibration records and context check, it exceeds equal weighting by 5.6 weakest-locus and 2.0 conventional AUROC points. Appendix E.9 reports this fixed-head comparison.
Table 15 tests the full feature-fusion MLP separately. Revised PlaceGuard improves weakest/conventional means over it by 1.1/7.2 points (79.5/91.4 versus 78.4/84.2). Even without context rejection, the revised verifier gives 79.7/88.6. An intact-record permutation preserves validity scores as a multiset, but multiplying them can reorder fit scores. The revision leaves fit unchanged for ordinary validity values; validity adds rejection only in the lowest 2.5% of clean validation validity scores. The heads stay fixed. The rule and cutoff were fixed after the original analysis and before evaluation on the existing reporting splits (Appendix E.9). The submitted product is retained as the scoring control in Table 16.
W4 & Q4 — Same-class errors and practical thresholds. Same-class swaps preserve class and text–image coherence, leaving recipient-specific fit as the detection signal. With a threshold set for 95% clean validation acceptance, revised scoring achieves 37.4±0.8% same-class recall and 6.2±0.7% clean-test rejection (Appendix B.4, Table 8). At 95% same-class error recall, clean FPR is 69.0%. For review-assisted admission, users set the threshold from a desired clean-validation acceptance rate and apply it to incoming records.
References
[1] K. Liu et al. BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs. NeurIPS Datasets and Benchmarks, 2022.