基于三角剖分的否定选择算法  

Immune Negative Selection Algorithm Based on Triangulation

作　　者：汪宏海 娄金霞[1,2] 柴争义 WANG Hong-hai;LOU Jin-xia;CHAI Zheng-yi(Zhejiang Institute of Culture and Tourism Development,Hangzhou 311231,China;Tourism College of Zhejiang,Hangzhou 311231,China;School of Computer Science and Software,Tianjin Polytechnic University,Tianjin 300387,China)

机构地区：[1]浙江省文化和旅游发展研究院,浙江杭州311231 [2]浙江旅游职业学院,浙江杭州311231 [3]天津工业大学计算机科学与软件学院,天津300387

出　　处：《长春师范大学学报》2023年第12期33-39,共7页Journal of Changchun Normal University

基　　金：国家自然科学基金项目“面向认知物联网的频谱大数据处理关键技术研究”(61972456)。

摘　　要：在网络安全中对网络异常数据进行检测十分必要。已有的V-detector否定选择算法在解决复杂网络数据问题时,随机生成检测器会消耗大量时间,不利于在线检测的快速实现。本文提出了一种基于Delaunay三角剖分的否定选择算法,在检测器的生成阶段使用三角剖分对检测器中心点进行定位,直接生成成熟检测器,并降低检测个数,从而降低检测器生成时的资源消耗。将本文算法与其他两种算法进行对比,实验结果表明,基于Delaunay三角剖分的否定选择算法在生成检测器时速度更快且生成个数更少,检测率也更高。It is very necessary to detect network abnormal data in network security.When the existing V-detector negative selection algorithm solves the complex network data problem,the random generation of detector will consume a lot of time,which is not conducive to the rapid implementation of on-line detection.In this paper,a negative selection algorithm based on Delaunay triangulation is proposed.In the detector generation stage,triangulation is used to locate the center point of the detector,directly generate mature detectors,and reduce the number of detectors,so as to reduce the resource consumption of detector generation.Comparing the proposed algorithm with the other two algorithms,the experimental results show that the negative selection algorithm based on Delaunay triangulation has faster speed,a smaller number of detectors and higher detection rate.

关 键 词：异常数据检测 三角剖分 否定选择算法 检测器 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]