Re:Show HN: Fast Real-Time Anomaly Detection in Dynamic Graphs
by shivin9 on Friday February 07, 2020 @09:57PM
(#22273490)
Thanks. It would be nice to have similarity methods that are not dependent on spatial locality to detect DDoS like attacks.
[ Parent
| on HN ]
Re:Show HN: Fast Real-Time Anomaly Detection in Dynamic Graphs
by siddharthbhatia on Friday February 07, 2020 @10:27PM
(#22273608)
We handle spatial locality in terms of not just the source but also the destination, therefore we should be able to handle DDoS like attacks when simultaneous edges come from several sources trying to deny one particular destination.
Re:Show HN: Fast Real-Time Anomaly Detection in Dynamic Graphs
by shivin9 on Friday February 07, 2020 @10:40PM
(#22273662)
Ah alright, that makes sense. But it works only when the destination is the same. In a setting where there are multiple web-hosting servers, you would need to treat a group of source and destination points as micro-clusters themselves.
Can you extend MIDAS to adapt to that scenario?
Re:Show HN: Fast Real-Time Anomaly Detection in Dynamic Graphs
by siddharthbhatia on Friday February 07, 2020 @11:12PM
(#22273810)
In Figure 7 of the paper, we show an example of detection when neither edge/source/destination is individually anomalous but as a whole, it is a microcluster anomaly. It can similarly be detected when there are multiple web-hosting servers.