面向子空间的否定选择算法  

Subspace-oriented negative selection algorithm

作　　者：杨韬[1] 邓红莉[2] 

机构地区：[1]西华师范大学实验中心,四川南充637002 [2]四川大学计算机学院,成都610064

出　　处：《计算机应用研究》2016年第2期435-438,443,共5页Application Research of Computers

基　　金：国家自然科学基金资助项目(61173159;614020308)

摘　　要：传统的否定选择算法无法有效识别落入到低维子空间的样本,导致算法在高维空间检测性能不佳。为此,提出了面向子空间的否定选择算法(subspace-oriented negative selection algorithm,SONSA)。在训练常规检测器的基础上,SONSA将搜索样本分布密度较高的低维子空间以进一步训练面向子空间的检测器,从而提高算法对低维子空间内样本的识别能力。实验结果表明,在标准数据集Haberman’s Survival(三维)与Breast Cancer Wisconsin(九维)上,相对于经典的V-Detector算法以及采用PCA降维的V-Detector算法,SONSA能在误报率相似的情况下显著地提高检测率。Traditional negative selection algorithm cannot distinguish these samples effectively, it causes the negative selection algorithm has a poor performance in high-dimensions features space. To deal this situation, this paper proposed a subspace-ori- ented negative selection algorithm （SONSA）. Besides training conventional detectors, SONSA would search out the subspace where the samples might distribute densely, then generated the subspace-oriented detectors for covering the aimed subspace as much as possible, thus improved detection rate of algorithm. The experimental result shows that, on the Haberman＇ s Survival dataset （31）） and Breast Cancer Wisconsin dataset （gD）, compared to the classical V-Detector algorithm and PCA V-Detec- tor algorithm, SONSA can reach the higher detection rate with the similar false alarm rate.

关 键 词：人工免疫 否定选择算法 检测器 子空间 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]