Research map / Graph learning / Graph algorithms and clustering
BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Escaping the Homophily Trap: A Threshold-free Graph Outlier Detection Framework via Clustering-guided Edge Reweighting (ICLR 2026 · similarity 0.89)
- Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark (ICLR 2025 · similarity 0.88)
- Structural Entropy Guided Unsupervised Graph Out-Of-Distribution Detection (AAAI 2025 · similarity 0.86)
- Graph Anomaly Detection as Dynamical Transport: Training-Free Scoring via Empirical Bayes (NeurIPS 2026 · similarity 0.86)
- UniGAD: Unifying Multi-level Graph Anomaly Detection (NeurIPS 2024 · similarity 0.86)
- Open-Set Graph Anomaly Detection via Normal Structure Regularisation (ICLR 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.