An adaptive anomaly detector for worm detection

  • Authors:
  • John Mark Agosta;Carlos Diuk-Wasser;Jaideep Chandrashekar;Carl Livadas

  • Affiliations:
  • Intel Research, Santa Clara, CA;Dept. of Computer Science, Rutgers University, New Brunswick, NJ;Intel Research, Santa Clara, CA;Intel Research, Santa Clara, CA

  • Venue:
  • SYSML'07 Proceedings of the 2nd USENIX workshop on Tackling computer systems problems with machine learning techniques
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an adaptive end-host anomaly detector where a supervised classifier trained as a traffic predictor is used to control a time-varying detection threshold. Using real enterprise traffic traces for both training and testing, we show that our detector outperforms a fixed-threshold detector. This comparison is robust to the choice of off-the-shelf classifier and to a variety of performance criteria, i.e., the predictor's error rate, the reduction in the "threshold gap," and the ability to detect incremental worm traffic that is added to real life traces. Our adaptive-threshold detector is intended as a part of a distributed worm detection system. This distributed system infers system-wide threats from end-host detections, thereby avoiding the sensing and resource limitations of conventional centralized systems. The system places a constraint on this end-host detector to appear consistent over time and host variability