A Bayesian network intrusion detection algorithm based on principal component analysis and sliding window Online publication date: Thu, 04-Dec-2014
by Zuhong Feng; Jing Li; Jie Hu Meichsner
International Journal of Security and Networks (IJSN), Vol. 9, No. 4, 2014
Abstract: In traditional Bayesian network (BN) intrusion detection, it is not taken into account that the dataset has an excessive number of attributes, which leads to an excessive calculation in the process of BN structure and thus greatly affects the detection efficiency. In addition, traditional BN intrusion does not consider attacks in the detection process; instead, it just simply relies on fixed BN to test the new dataset, which has a certain impact on detection accuracy. To solve these two problems, a new BN intrusion detection technology based on principal component analysis (PCA) and sliding window is introduced in this paper. The new algorithm reduces data dimensionality and uses the detected data to update the training dataset, which relatively completely reflects the overall status of the system. The experiments show that the improved algorithm can greatly reduce the computation cost and improve the detection accuracy.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook