检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山东大学计算机科学与技术学院,山东济南250101
出 处:《山东大学学报(工学版)》2010年第5期8-11,共4页Journal of Shandong University(Engineering Science)
基 金:山东省自然科学基金资助项目(ZR2009GM021)
摘 要:针对负选择算法中抗原合法性检测时存在重复检测、逐位比较、检测效率低的问题,提出了基于检测树的抗原合法性快速检测方法。采用分步构造的方式将检测器集合构造为一棵检测树,待检测抗原只需在该检测树上进行一次路径搜索即可判段该抗原的合法性。实验结果表明,该方法检测效率优于遍历检测器集合逐位比较的检测方法,可以满足实时检测的要求,为基于人工免疫原理的异常检测问题提供了一种有效途径。To overcome the problems of low detection efficiency such as duplicate detection,bit by bit comparison on detecting the antigen's legitimacy with a negative selection algorithm,a legitimacy detection method of antigen based on a detection tree was proposed.A detection tree with detectors using the step by step manner was constructed.The legitimacy of antigens could be detected by path searching in the detection tree.Experimental results showed that the testing method based on the detection tree was better than the method by traversing detector collection and bit by bit comparisons,which could meet the requirements of real-time detection.This provides an efficient way for anomaly detection based on the artificial immune principle.
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145