3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in graph-outlier-detection-21
No benchmarks available.
Use these libraries to find graph-outlier-detection-21 models and implementations
No datasets available.
No subtasks available.
This work presents the first comprehensive benchmark for unsupervised outlier node detection on static attributed graphs called BOND, and benchmark the outlier detection performance of 14 methods ranging from classical matrix factorization to the latest graph neural networks.
As the first comprehensive library of its kind, PyGOD supports a wide array of leading graph-based methods for outlier detection under an easy-to-use, well-documented API designed for use by both researchers and practitioners.
A novel variance-based model is devised to detect structural outliers, which outperforms existing algorithms significantly and is more robust at kinds of injection settings and a new framework is proposed, Variance-based Graph Outlier Detection (VGOD), which combines the variance- based model and attribute reconstruction model to detect outliers in a balanced way.
GODM, a novel data augmentation for mitigating class imbalance in supervised Graph Outlier detection with latent Diffusion Models is introduced and the case study further demonstrated the generation quality of the synthetic data.
Adding a benchmark result helps the community track progress.