An effective intrusion detection framework based on MCLP/SVM optimized by time-varying chaos particle swarm optimization

被引:144
作者
Bamakan, Seyed Mojtaba Hosseini [1 ,2 ]
Wang, Huadong [1 ]
Tian Yingjie [1 ]
Shi, Yong [1 ,2 ,3 ]
机构
[1] Univ Chinese Acad Sci, Key Lab Big Data Min & Knowledge Management, Beijing 10090, Peoples R China
[2] Univ Chinese Acad Sci, Sch Econ & Management, Beijing 10090, Peoples R China
[3] Univ Nebraska, Coll Informat Sci & Technol, Omaha, NE 68182 USA
基金
中国国家自然科学基金;
关键词
Intrusion detection; Support vector machine; Parameter setting; Feature selection; SUPPORT VECTOR MACHINES; FEATURE-SELECTION; DETECTION SYSTEM; ANOMALY DETECTION; SVM; CLASSIFIER; PSO;
D O I
10.1016/j.neucom.2016.03.031
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many organizations recognize the necessities of utilizing sophisticated tools and systems to protect their computer networks and reduce the risk of compromising their information. Although many machine learning-based data classification algorithm has been proposed in network intrusion detection problem, each of them has its own strengths and weaknesses. In this paper, we propose an effective intrusion detection framework by using a new adaptive, robust, precise optimization method, namely, time varying chaos particle swarm optimization (TVCPSO) to simultaneously do parameter setting and feature selection for multiple criteria linear programming (MCLP) and support vector machine (SVM). In the proposed methods, a weighted objective function is provided, which takes into account trade-off between the maximizing the detection rate and minimizing the false alarm rate, along with considering the number of features. Furthermore, to make the particle swarm optimization algorithm faster in searching the optimum and avoid the search being trapped in local optimum, chaotic concept is adopted in PSO and time varying inertia weight and time varying acceleration coefficient is introduced. The performance of proposed methods has been evaluated by conducting experiments with the NSL-KDD dataset, which is derived and modified from well-known KDD cup 99 data sets. The empirical results show that the proposed method performs better in terms of having a high detection rate and a low false alarm rate when compared with the obtained results using all features. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:90 / 102
页数:13
相关论文
共 75 条
  • [51] An intelligent algorithm with feature selection and decision rules applied to anomaly intrusion detection
    Lin, Shih-Wei
    Ying, Kuo-Ching
    Lee, Chou-Yuan
    Lee, Zne-Jung
    [J]. APPLIED SOFT COMPUTING, 2012, 12 (10) : 3285 - 3290
  • [52] Improved particle swarm optimization combined with chaos
    Liu, B
    Wang, L
    Jin, YH
    Tang, F
    Huang, DX
    [J]. CHAOS SOLITONS & FRACTALS, 2005, 25 (05) : 1261 - 1271
  • [53] Mahoney M.V., 2003, Recent Advances in Intrusion Detection
  • [54] Successive overrelaxation for support vector machines
    Mangasarian, OL
    Musicant, DR
    [J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1999, 10 (05): : 1032 - 1037
  • [55] Intrusion Detection using Naive Bayes Classifier with Feature Reduction
    Mukherjee, Saurabh
    Sharma, Neelam
    [J]. 2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION, CONTROL AND INFORMATION TECHNOLOGY (C3IT-2012), 2012, 4 : 119 - 128
  • [56] Olariu Stephan., 2005, HDB BIOINSPIRED ALGO
  • [57] Anomaly Detection: A Survey
    Chandola, Varun
    Banerjee, Arindam
    Kumar, Vipin
    [J]. ACM COMPUTING SURVEYS, 2009, 41 (03)
  • [58] Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients
    Ratnaweera, A
    Halgamuge, SK
    Watson, HC
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (03) : 240 - 255
  • [59] On comparing classifiers: Pitfalls to avoid and a recommended approach
    Salzberg, SL
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 1997, 1 (03) : 317 - 328
  • [60] Shi Y, 2011, ADV INFORM KNOWL PRO, P3, DOI 10.1007/978-0-85729-504-0_1