Research map / Graph learning / Graph self-supervised learning
Escaping the Homophily Trap: A Threshold-free Graph Outlier Detection Framework via Clustering-guided Edge Reweighting
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
- BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs (NeurIPS 2022 · similarity 0.89)
- Unifying Unsupervised Graph-Level Anomaly Detection and Out-of-Distribution Detection: A Benchmark (ICLR 2025 · similarity 0.87)
- UniGAD: Unifying Multi-level Graph Anomaly Detection (NeurIPS 2024 · similarity 0.87)
- ARC: A Generalist Graph Anomaly Detector with In-Context Learning (NeurIPS 2024 · similarity 0.87)
- Semi-supervised Graph Anomaly Detection via Robust Homophily Learning (NeurIPS 2025 · similarity 0.87)
- UniFORM: Towards Unified Framework for Anomaly Detection on Graphs (AAAI 2025 · similarity 0.87)
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.