Fast and Effective Worm Fingerprinting via Machine Learning (2006)
Stewart Yang, Jianping Song, Harish Rajamani, Taewon Cho, Yin Zhang and Raymond Mooney
As Internet worms become ever faster and more sophisticated, it is important to be able to extract worm signatures in an accurate and timely manner. In this paper, we apply machine learning to automatically fingerprint polymorphic worms, which are able to change their appearance across every instance. Using real Internet traces and synthetic polymorphic worms, we evaluated the performance of several advanced machine learning algorithms, including naive Bayes, decision-tree induction, rule learning, and support vector machines. The results are very promising. Compared with Polygraph, the state of the art in polymorphic worm fingerprinting, several machine learning algorithms are able to generate more accurate signatures, tolerate more noise in the training data, and require much shorter training time. These results open the possibility of applying machine learning to build a fast and accurate online worm fingerprinting system.
Technical Report AI-06-335, Artificial Intelligence Lab, The University of Texas at Austin. This is a longer version of our ICAC-2006 paper.

Raymond J. Mooney Faculty mooney [at] cs utexas edu
Meng (Stewart) Yang Masters Alumni windtown [at] cs utexas edu