Show HN: Fast Real-Time Anomaly Detection in Dynamic Graphs

Re:Show HN: Fast Real-Time Anomaly Detection in Dynamic Graphs by arjitjain on Friday February 07, 2020 @05:24PM (#22271767)

Great work! However, from what I understand, microcluster detection seems to be very similar to subgraph detection. Is there a difference between the two problems? And if yes, then how do their complexities compare?

[ Parent | on HN ]

Re:Show HN: Fast Real-Time Anomaly Detection in Dynamic Graphs by siddharthbhatia on Friday February 07, 2020 @06:50PM (#22272446)

Thanks! There is a subtle difference. We define microclusters within the category of anomalous edge detection as 'suddenly arriving groups of suspiciously similar edges' e.g. denial of service attacks in network traffic data and lockstep behavior.

Subgraph detection on the other hand is detecting anomalous subgraphs and may also not be able to detect microclusters (suddenly arriving groups of suspiciously similar edges.)

[ Parent | on HN ]