计算机应用 ›› 2018, Vol. 38 ›› Issue (11): 3231-3235.DOI: 10.11772/j.issn.1001-9081.2018041315

• 第七届中国数据挖掘会议(CCDM 2018) • 上一篇    下一篇

改进的飞蛾扑火优化算法在网络入侵检测系统中的应用

徐慧, 方策, 刘翔, 叶志伟   

  1. 湖北工业大学 计算机学院, 武汉 430068
  • 收稿日期:2018-04-14 修回日期:2018-06-27 出版日期:2018-11-10 发布日期:2018-11-10
  • 通讯作者: 徐慧
  • 作者简介:徐慧(1983-),女,湖北武汉人,副教授,博士,CCF会员,主要研究方向:网络与服务管理;方策(1994-),男,湖北黄冈人,硕士研究生,主要研究方向:网络安全、数据挖掘;刘翔(1993-),男,湖北武汉人,硕士研究生,主要研究方向:网络安全、优化算法;叶志伟(1978-),男,湖北浠水人,教授,博士,主要研究方向:智能计算、机器学习。
  • 基金资助:
    国家自然科学基金资助项目(61602162,61440024)。

Network intrusion detection system based on improved moth-flame optimization algorithm

XU Hui, FANG Ce, LIU Xiang, YE Zhiwei   

  1. School of Computer Science, Hubei University of Technology, Wuhan Hubei 430068, China
  • Received:2018-04-14 Revised:2018-06-27 Online:2018-11-10 Published:2018-11-10
  • Supported by:
    This work is partially supported by the National Natural Science Foundation of China (61602162, 61440024).

摘要: 针对当前网络入侵检测中的数据量较大、数据维度较高的特点,将飞蛾扑火优化(MFO)算法应用于网络入侵检测的特征选择中。鉴于MFO算法收敛过快、易陷入局部最优的问题,提出一种融合粒子群优化(PSO)的二进制飞蛾扑火优化(BPMFO)算法。该算法引入MFO螺旋飞行公式,具有较强的局部搜索能力;结合了粒子群优化(PSO)算法的速度更新方法,让种群个体随着全局最优解和历史最优解的方向移动,增强算法的全局收敛性,从而避免易陷入局部最优。仿真实验以KDD CUP 99数据集为实验基础,分别采用支持向量机(SVM)、K最近邻(KNN)算法和朴素贝叶斯(NBC)3种分类器,与二进制飞蛾扑火优化(BMFO)算法、二进制粒子群优化(BPSO)算法、二进制遗传算法(BGA)、二进制灰狼优化(BGWO)算法和二进制布谷鸟搜索(BCS)算法进行了实验对比。实验结果表明,BPMFO算法应用于网络入侵检测的特征选择时,在算法精度、运行效率、稳定性、收敛速度以及跳出局部最优的综合性能上具有明显优势。

关键词: 网络入侵检测, 特征选择, 飞蛾扑火优化算法, 粒子群优化算法, 融合

Abstract: Due to a large amount of data and high dimension in currently network intrusion detection, a Moth-Flame Optimization (MFO) algorithm was applied to the feature selection of network intrusion detection. Since MFO algorithm converges fast and easy falls into local optimum, a Binary Moth-Flame Optimization integrated with Particle Swarm Optimization (BPMFO) algorithm was proposed. On one side, the spiral flight formula of the MFO algorithm was introduced to obtain strong local search ability. On the other side, the speed updating formula of the Particle Swarm Optimization (PSO) algorithm was combined to make the individual to move in the direction of global optimal solution and historical optimal solution, in order to increase the global convergence and avoid to fall into local optimum. By adopting KDD CUP 99 data set as the experimental basis, using three classifiers of Support Vector Machine (SVM), K-Nearest Neighbor (KNN) and Naive Bayesian Classifier (NBC), Binary Moth-Flame Optimization (BMFO), Binary Particle Swarm Optimization (BPSO), Binary Genetic Algorithm (BGA), Binary Grey Wolf Optimization (BGWO) and Binary Cuckoo Search (BCS) were compared in the experiment. The experimental results show that, BPMFO algorithm has obvious advantages in the comprehensive performance including algorithm accuracy, operation efficiency, stability, convergence speed and jumping out of local optima when it is applied to the feature selection of network intrusion detection.

Key words: network intrusion detection, feature selection, Moth-Flame Optimization (MFO) algorithm, Particle Swarm Optimization (PSO) algorithm, integration

中图分类号: