期刊文献+

一种提高检测率的免疫优化模型 被引量:2

An Immune Principle and Optimization Model Increasing Detection Rate
下载PDF
导出
摘要 文章建立了一种基于免疫原理的提高检测率的优化模型。通过提出匹配强度概念,给出了检测子之间的重叠和检测集与自我集的重叠的计算方法。进一步用最小化检测子之间的重叠代替最大化检测集的覆盖,用检测集与自我集的重叠代替自身耐受约束,建立了计算检测集分布的优化模型,避免了在检测集的覆盖计算中使用并集公式和蒙特卡罗方法。选择经典的Iris数据集进行实验,结果表明,基于免疫优化模型的二进选择算法产生的检测集的覆盖大于线性算法和贪婪算法产生的检测集的覆盖,提高了入侵检测等异常检测的检测率。 This paper proposes an immune optimization model to increase intrusion detection rate. Via puting forward the concept of match strength, overlapping among detectors and overlapping between detectors and self set are defined, and instead of maximizing the cover of detectors and restricted by self tolerance, minimizing overlapping among detectors and overlapping between detectors and self set is used separately. Optimization model of distribution of detectors is established, which avoids the difficult to use union of set formula and Monte Carlo method directly. Iris data set is chosen to carry through experiments, the results show that the coverage of detector set generated by anomaly detection method based on immune principle and optimization model is larger than that generated by linear time detector generating algorithm and greedy detector generating algorithm, and can increase detection rate when applying in intrusion detection.
出处 《微电子学与计算机》 CSCD 北大核心 2006年第5期195-199,共5页 Microelectronics & Computer
基金 国家自然科学基金重大研究计划(90104005) 重大基础研究前期研究专项(2003CCA00200)
关键词 优化模型 免疫原理 检测率 入侵检测 Optimization model, Immune principle, Detection rate, Intrusion detection
  • 相关文献

参考文献4

二级参考文献46

  • 1[英]PM利迪亚德 A惠兰 M W范杰.林慰慈 薛彬 魏雪涛译.免疫学[M].北京:科学出版社,2001..
  • 2[1] Karp, R.M., Pippenger, N., Sipser, M. A time-randomness tradeoff. Presented at the AMS Conference on Probabilistic Computational Complexity, Durham, NC, 1985.
  • 3[2] Koller, D., Megiddo, N. Constructing small sample spaces satisfying given constraints. In: Aggarwal, A. ed. Proceedings of the 25th ACM Annual Symposium on Theory of Computing. San Diego, California: ACM Press, 1993. 268~277.
  • 4[3] Alon, N., Goldreich, O., Hastad, J., et al. Simple constructions of almost k-wise independent random variables. In: Yannakakis, M. ed. Proceedings of the 31st Annual Symposium on Foundations of Computer Science. Los Alamitos, California: IEEE Computer Society Press, 1990. 544~553.
  • 5[4] Karloff, H., Mansour, Y. On construction of k-wise independent random variables. In: Goodrich, M. ed. Proceedings of the 26th ACM Annual Symposium on Theory of Computing. Montréal, Québec, Canada: ACM Press, 1994. 564~573.
  • 6[5] Wigderson, A. The amazing power of pair-wise independence. Presented at the 17th ACM Annual Symposium on Theory of Computing. Montréal, Québec, Canada, 1994. 645~647.
  • 7[6] Luby, M. A simple parallel algorithm for the maximal independent set. SIAM Journal of Computing, 1986,15(4):1036~1053.
  • 8[7] Chor, B., Goldreich, O. On the power of two-point based sampling. Journal of Complexity, 1989,5(1):96~106.
  • 9[8] Karp, R.M., Luby, M., Madras, N. Monte-Carlo approximation algorithm for enumeration problems. Journal of Algorithms, 1989,10(3):429~448.
  • 10[9] Rajeev, M., Prabhaka, R. Randomized Algorithms. Cambridge: Cambridge University Press, 1995.

共引文献41

同被引文献22

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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