MIDAS
MIDAS, short for Microcluster-Based Detector of Anomalies in Edge Streams, detects microcluster anomalies from an edge stream in constant time and memory, while providing theoretical guarantees about its false positive probability. We output an anomaly score for each edge.
This implementation is based on the following paper - MIDAS:Microcluster-Based Detector of Anomalies in Edge Streams. Siddharth Bhatia, Bryan Hooi, Minji Yoon, Kijung Shin, Christos Faloutsos. AAAI 2020.
Getting started
- Run
make
to compile code and create the binary. - Run
./midas -i
followed by the input file path and name. - Run
make clean
to clean binaries.
Demo
- Run
./demo.sh
to compile the code and run it on example dataset.
Command line options
-h --help
: produce help message-i --input
: input file name-o --output
: output file name (default: scores.txt)-r --rows
: Number of Hash Functions (default: 2)-b --buckets
: Number of Buckets (default: 769)-a --alpha
: Temporal Decay Factor (default: 0.6)--norelations
: Run MIDAS instead of MIDAS-R--undirected
: Treat graph as undirected instead of directed
Input file format
MIDAS expects the input edge stream to be stored in a single file containing the following three columns in order:
source (int)
: source ID of the edgedestination (int)
: destination ID of the edgetime (int)
: time stamp of the edge
Thus, each line represents an edge. Edges should be sorted in non-decreasing order of their time stamps and the column delimiter should be ,
Datasets
Citation
If you use this code for your research, please consider citing our paper.
@article{bhatia2019midas, title={MIDAS: Microcluster-Based Detector of Anomalies in Edge Streams}, author={Bhatia, Siddharth and Hooi, Bryan and Yoon, Minji and Shin, Kijung and Faloutsos, Christos}, journal={arXiv preprint arXiv:1911.04464}, year={2019} }
from Hacker News https://github.com/bhatiasiddharth/MIDAS/
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.