Scaling IDS construction based on Non-negative Matrix factorization using GPU computing
Department of Computer Science, VSB-Technical University of Ostrava, Ostrava, Czech Republic
Sixth International Conference on Information Assurance and Security (IAS), 2010
@inproceedings{platos2010scaling,
title={Scaling IDS construction based on Non-negative Matrix factorization using GPU computing},
author={Platos, J. and Kromer, P. and Snasel, V. and Abraham, A.},
booktitle={Information Assurance and Security (IAS), 2010 Sixth International Conference on},
pages={86–91},
organization={IEEE},
year={2010}
}
Attacks on the computer infrastructures are becoming an increasingly serious problem. Whether it is banking, e-commerce businesses, health care, law enforcement, air transportation, or education, we are all becoming increasingly reliant upon the networked computers. The possibilities and opportunities are limitless; unfortunately, so too are the risks and chances of malicious intrusions. Intrusion detection is required as an additional wall for protecting systems despite of prevention techniques and is useful not only in detecting successful intrusions, but also in monitoring attempts to security, which provides important information for timely countermeasures. This paper presents some improvements to some of our previous approaches using a Non-negative Matrix factorization approach. To improve the performance (detection accuracy) and computational speed (scaling) a GPU implementation is detailed. Empirical results indicate that the speedup was up to 500x for the training phase and up to 190x for the testing phase.
May 12, 2011 by hgpu