Browse State-of-the-Art › Anomaly Detection in Edge Streams

Anomaly Detection in Edge Streams

5 papers with code · 0 benchmarks · 1 dataset archive 2025-07-28

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

1 dataset whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 6 · with a code link: 5 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 6 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 6 of 6, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • 11 Nov 2019 9 repositories listed
    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?
  • 17 Sep 2020 3 repositories listed
    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?
  • 19 Feb 2024 2 repositories listed
    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.
  • 9 Nov 2020 1 repository listed
    Edge streams are commonly used to capture interactions in dynamic networks, such as email, social, or computer networks.
  • 20 Nov 2018 1 repository listed
    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.
  • A Scalable Approach for Outlier Detection in Edge Streams Using Sketch-based Approximations
    7 May 2016 0 repositories listed
    Dynamic graphs are a powerful way to model an evolving set of objects and their ongoing interactions.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections