DocumentCode
1594529
Title
Optimized Zero False Positives Perceptron Training for Malware Detection
Author
Gavrilut, Dragos ; Benchea, R. ; Vatamanu, Cristina
Author_Institution
Romania Bitdefender Anti-virus Res. Lab., Al. I. Cuza Univ. of Iasi, Iasi, Romania
fYear
2012
Firstpage
247
Lastpage
253
Abstract
The increasing number of malware in the past 4 years has determined researchers to test different machine learning techniques to automate the detection system. But because of the large size of the dataset and the need of having a high detection rate, the resulted models have often produced many false positives. This paper proposes a modified version of the perceptron algorithm able to detect malware samples while training at a low rate (even zero) of false positives. A very low number of false positives is crucial because in a real life situation detecting a clean file as malware can destroy the operating system or render other programs unusable. We also provide a method of optimizing the training speed for the algorithm while maintaining the same accuracy. The resulted algorithm can be used in an ensemble or voting system to increase detection and eliminate false positives.
Keywords
data mining; distributed algorithms; invasive software; learning (artificial intelligence); operating systems (computers); clean file detection; data mining; detection system automation; distributed algorithms; ensemble system; machine learning techniques; malware detection; operating system; optimized zero false positives perceptron training; perceptron algorithm; training speed optimization; voting system; Classification algorithms; Databases; Educational institutions; Machine learning algorithms; Malware; Optimization; Training; Perceptron; data mining; distributed algorithms; large dataset; one side class; reducing false positives;
fLanguage
English
Publisher
ieee
Conference_Titel
Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2012 14th International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4673-5026-6
Type
conf
DOI
10.1109/SYNASC.2012.34
Filename
6481037
Link To Document