AI Paper Atlas

Research map / Graph learning / Graph self-supervised learning

Graph Scan Statistics With Uncertainty

Jose Cadena, Arinjoy Basak, Anil Vullikanti, Xinwei Deng

AAAI 2018 · Graph learning › Graph self-supervised learning · approach: Graph anomaly detection · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
account for uncertainty with AggregateSAA and BestMax instead of picking one random replicate (B-SAA, B-Max-Min)scan statistic detection · NEast (Kulldorff)F1 score: at least a 20% improvement on 25% of combinationsImproved
easy-to-detect cluster instead of medium difficultyAggregateSAA and BestMax · NEastF1 improvement over baselineNo clear effect
Max-Min formulation instead of SAAuncertainty-aware scan · NEast medium clusterF1 improvementImproved
increase noise levelall methods · BWSN (BJ)F1 scoreHurt
BestMax instead of B-Max-MinProblem 2 · BWSN (BJ)objective score: over 20%Improved
increase number of replicates NAggregateSAA and BestMax · BWSNF1 scoreImproved
increase number of replicates Nbaseline · BWSNF1 scoreNo clear effect
increase noise levelAggregateSAA approximation guarantee · BWSNempirical approximation ratio: at least 80%Hurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy