Pith. sign in

REVIEW 1 cited by

SLADE: Detecting Dynamic Anomalies in Edge Streams without Labels via Self-Supervised Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.11933 v3 pith:HGN5744R submitted 2024-02-19 cs.LG cs.SI

classification cs.LGcs.SI
keywords edgeanomaliesdynamicsladestreamsanomalydetectiongraphs
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

To detect anomalies in real-world graphs, such as social, email, and financial networks, various approaches have been developed. While they typically assume static input graphs, most real-world graphs grow over time, naturally represented as edge streams. In this context, we aim to achieve three goals: (a) instantly detecting anomalies as they occur, (b) adapting to dynamically changing states, and (c) handling the scarcity of dynamic anomaly labels. In this paper, we propose SLADE (Self-supervised Learning for Anomaly Detection in Edge Streams) for rapid detection of dynamic anomalies in edge streams, without relying on labels. SLADE detects the shifts of nodes into abnormal states by observing deviations in their interaction patterns over time. To this end, it trains a deep neural network to perform two self-supervised tasks: (a) minimizing drift in node representations and (b) generating long-term interaction patterns from short-term ones. Failure in these tasks for a node signals its deviation from the norm. Notably, the neural network and tasks are carefully designed so that all required operations can be performed in constant time (w.r.t. the graph size) in response to each new edge in the input stream. In dynamic anomaly detection across four real-world datasets, SLADE outperforms nine competing methods, even those leveraging label supervision.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Generalizable Anomaly Detection Method in Dynamic Graphs

    cs.LG 2024-12 reject novelty 4.0 of 10

    GeneralDyG combines ego-graph sampling, an alternating node/edge GNN, and a transformer to detect anomalies in dynamic graphs, reporting strong results on four benchmarks, though the claimed generalizability is not ac...

Pith tools