Network Anomaly Intrusion Detection Using a Nonparametric Bayesian Approach and Feature Selection

被引:86
作者
Alhakami, Wajdi [1 ]
Alharbi, Abdullah [1 ]
Bourouis, Sami [1 ,2 ]
Alroobaea, Roobaea [1 ]
Bouguila, Nizar [3 ]
机构
[1] Taif Univ, Coll Comp & Informat Technol, At Taif 21431, Saudi Arabia
[2] Univ Tunis El Manar, LR SITI Lab Signal Image & Technol Informat, Tunis 1002, Tunisia
[3] Concordia Univ, CIISE, Montreal, PQ H3G 1T7, Canada
关键词
Intrusion detection systems (IDS); anomaly intrusion detection; infinite mixture models; bounded generalized Gaussian models; Bayesian inference; Markov chain Monte Carlo (MCMC); DETECTION SYSTEM; MIXTURE-MODELS; MACHINE;
D O I
10.1109/ACCESS.2019.2912115
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Anomaly-based intrusion detection systems (IDSs) have been deployed to monitor network activity and to protect systems and the Internet of Things (IoT) devices from attacks (or intrusions). The problem with these systems is that they generate a huge amount of inappropriate false alarms whenever abnormal activities are detected and they are not too flexible for a complex environment. The high-level rate of the generated false alarms reduces the performance of IDS against cyber-attacks and makes the tasks of the security analyst particularly difficult and the management of intrusion detection process computationally expensive. We study here one of the challenging aspects of computer and network security and we propose to build a detection model for both known and unknown intrusions (or anomaly detection) via a novel nonparametric Bayesian model. The design of our framework can be extended easily to be adequate for IoT technology and notably for intelligent smart city web-based applications. In our method, we learn the patterns of the activities (both normal and anomalous) through a Bayesian-based MCMC inference for infinite bounded generalized Gaussian mixture models. Contrary to classic clustering methods, our approach does not need to specify the number of clusters, takes into consideration the uncertainty via the introduction of prior knowledge for the parameters of the model, and permits to solve problems related to over-and under-fitting. In order to get better clustering performance, feature weights, model's parameters, and the number of clusters are estimated simultaneously and automatically. The developed approach was evaluated using popular data sets. The obtained results demonstrate the efficiency of our approach in detecting various attacks.
引用
收藏
页码:52181 / 52190
页数:10
相关论文
共 44 条
[1]   A survey of network anomaly detection techniques [J].
Ahmed, Mohiuddin ;
Mahmood, Abdun Naser ;
Hu, Jiankun .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2016, 60 :19-31
[2]   Multi-level hybrid support vector machine and extreme learning machine based on modified K-means for intrusion detection system [J].
Al-Yaseen, Wathiq Laftah ;
Othman, Zulaiha Ali ;
Nazri, Mohd Zakree Ahmad .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 67 :296-303
[3]  
[Anonymous], 2011, P 1 WORKSH BUILD AN, DOI DOI 10.1145/1978672.1978676
[4]  
[Anonymous], COMPUTERS SECURITY
[5]   Positive vectors clustering using inverted Dirichlet finite mixture models [J].
Bdiri, Taoufik ;
Bouguila, Nizar .
EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (02) :1869-1882
[6]  
Benferhat Salem, 2008, 2008 IEEE 32nd International Computer Software and Applications Conference (COMPSAC), P704, DOI 10.1109/COMPSAC.2008.213
[7]  
Bhuyan MH, 2014, COMPUT INFORM, V33, P1
[8]   A countably infinite mixture model for clustering and feature selection [J].
Bouguila, Nizar ;
Ziou, Djemel .
KNOWLEDGE AND INFORMATION SYSTEMS, 2012, 33 (02) :351-370
[9]   Infinite Liouville mixture models with application to text and texture categorization [J].
Bouguila, Nizar .
PATTERN RECOGNITION LETTERS, 2012, 33 (02) :103-110
[10]   A Model-Based Approach for Discrete Data Clustering and Feature Weighting Using MAP and Stochastic Complexity [J].
Bouguila, Nizar .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (12) :1649-1664