期刊文献+

基于竞争学习型否定选择算法的孔洞检测

Detecting Holes by Competitive Learning Negative Selection Algorithm
下载PDF
导出
摘要 为了检测人工免疫系统中存在的孔洞,提出一种基于竞争学习的否定选择算法。该算法依据自体集和非自体集产生两个检测器集合,分别对非自体和孔洞进行检测。借鉴竞争型神经网络的特点,检测器之间构成一种竞争学习的关系。针对工程应用中自体集和非自体集可能动态变化的情况,检测器集合会根据当前自体集和非自体集自动更新。仿真实验表明,该算法可以有效地检测出孔洞。 A negative selection algorithm based on competitive learning was proposed in order to detect holes in artificial immune system. Holes and non-selves were detected by two detectors sets that were generated according to selves and non-selves. Drawing lessons from competitive neural networks, the two detectors sets will be updated automatically in the light of selves and non-selves. The results of experiments prove that the algorithm can detect holes effectively.
作者 匡胤
出处 《四川理工学院学报(自然科学版)》 CAS 2007年第3期79-81,共3页 Journal of Sichuan University of Science & Engineering(Natural Science Edition)
基金 四川省教育厅自然科学类重点项目(2004A176) 四川省教育厅青年基金项目(2005B043)
关键词 人工免疫系统 孔洞 竞争学习 否定选择算法 artificial immune system hole competitive learning negative selection algorithm
  • 相关文献

参考文献2

二级参考文献6

  • 1DENNING DE, An Intrusion Detection Model [ J] . IEEE Trans on Soft Engineering, 1987, 13(2) : 222 -232.
  • 2FORREST S , HOFMEYR SA . Immunlogy as Processing Design Principles for Immune Systems & Other Distrubuted Autonomous Systems[ M]. SEGAL A, COHEN IR eds Oxford Univ Press, 2000.
  • 3FORREST S, HOFMEYR SA, SOMAYAJI A. A Sense of Self for Unix Process[ A]. Proceedings of 1996 IEEE Symposium on Computer Security and Privacy [ C]. Oakland, California: IEEE Computer Society Press, 1996. 120 - 128.
  • 4LEE W. A Data Mining Framework for Constructing Features and Models for Intrusion Detection Systems [ J]. PhD thesis, Columbia University, 1999.
  • 5LANE T , BRODLEY CE . Temporal Sequence Learning and Data Reduction for Anomaly Detection[ J]. ACM Transactions on Information and System Security, 1999, 2 (3) : 295 - 331.
  • 6陈毓屏,康立山,潘正君,何巍.一个新的研究领域──演化硬件[J].航空计算技术,1998,28(1):1-8. 被引量:76

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部