非负矩阵分解在免疫入侵检测中的优化和应用  

Optimization and Application of Non-negative Matrix Factorization in Immune Intrusion Detection

作　　者：张凤斌[1] 葛海洋[1] 杨泽[1] 

机构地区：[1]哈尔滨理工大学计算机科学与技术学院,哈尔滨150080

出　　处：《计算机工程》2016年第5期173-178,185,共7页Computer Engineering

基　　金：国家自然科学基金资助项目"免疫动态自适应机制研究"(61172168)

摘　　要：针对免疫入侵检测数据处理速度慢以及检测实时性差的问题,提出Bregman非负矩阵分解算法,采用Bregman迭代方式改进传统非负矩阵分解过程,优化矩阵迭代过程,利用矩阵本地化方法分解矩阵,增加矩阵的约束,保留检测数据内部结构并且加快数据的处理速度。在KDD CUP 1999数据集上的仿真结果表明,该算法有效提高了入侵检测速度,增强了免疫入侵检测的时效性。To deal with the problem of slow data processing speed and poor timeliness of immune intrusion detection, non-negative matrix factorization by Bregman iteration is proposed. It improves the traditional method, changes matrix iteration process, and uses matrix location to realize the decomposition conditions and its constraint, better retention of the internal structure of the data and acceleration of the processing. Experimental results in KDD CUP 1999 datasets show that the approach can improve the speed of intrusion detection and enhance the timeliness of immune intrusion detection.

关 键 词：免疫入侵检测 非负矩阵分解 Bregman算法 迭代 矩阵本地化 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]