2 papers with code • 1 benchmarks • 1 datasets
Given a stream of graph edges from a dynamic graph, how can we assign anomaly scores to edges in an online manner, for the purpose of detecting unusual behavior, using constant time and memory?
Ranked #1 on Anomaly Detection in Edge Streams on Darpa
Given a stream of edges from a time-evolving (un)weighted (un)directed graph, we consider the problem of detecting anomalous edges in near real-time using sublinear memory.
Ranked #2 on Anomaly Detection in Edge Streams on Darpa