<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sketch-Based Anomaly Detection in Streaming Graphs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2106.04486/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2106.04486/feed.xml" rel="self" type="application/rss+xml" /><item><title>Sketch-Based Anomaly Detection in Streaming Graphs — mentioned by siddharthb_</title><link>https://news.ycombinator.com/item?id=27549246</link><guid isPermaLink="false">urn:hackerpapers:mention:2106.04486:27549246</guid><pubDate>Fri, 18 Jun 2021 11:12:16 GMT</pubDate><description>&lt;p&gt;Existing streaming graph anomaly detection methods only detect edge or subgraph anomalies. We extend count-min sketch to higher-order preserving the dense subgraph structure &amp;amp; detect both. Our approach is the first streaming method that uses dense subgraph search to detect graph anomalies in constant memory and time. Preprint of the paper is at https://arxiv.org/pdf/2106.04486.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2106.04486/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
