期刊文献+

基于加权移动窗口的入侵检测算法研究 被引量:1

Research of intrusion detection algorithm based on weighted moving window
在线阅读 下载PDF
导出
摘要 为克服目前入侵检测技术检测反应速度慢、误检率和漏检率较高等问题,研究了加权移动窗口这种数据挖掘方法。首先对现有的移动窗口算法MFI-TransSW和Moment进行了认知与分解,指出现有算法的缺陷,提出了加权移动窗口的详细算法,自动调整训练窗口,并对检测模式进行及时的更新;在此基础上建立了基于加权移动窗口的入侵检测系统模型。最后实例检测和结果分析表明,在不同窗口大小、不同最小支持度、数据集增大时该算法执行时间均优于其他算法。 To overcome the current intrusion detection question that detecting response was slow,and false detection rate and false negative rates were relatively high and so on,studied the weighted moving window of this data mining method.Firstly,recognized and decomposed the existing mobile window algorithms.It pointed out that the shortcomings of existing algorithms,presented the detailed algorithm of the weighted moving window,adjusted the training window automatically,and updated timely the patterns of detection.Based on the weighted moving window algorithm,constructed a weighted moving window-based intrusion detection system model.Finally,an example testing and result analysis shows that the execution time of the algorithm in different window sizes,different minimum support and the increasing data sets is better than other algorithms.
作者 鲁志萍 刘渊
出处 《计算机应用研究》 CSCD 北大核心 2010年第7期2643-2646,共4页 Application Research of Computers
关键词 入侵检测系统模型 数据挖掘 移动窗口算法 加权移动窗口 网络数据流 频繁集 支持度 intrusion detection system model data mining moving window algorithm weighted moving window network data flow frequent sets degree of support
  • 相关文献

参考文献9

二级参考文献54

共引文献22

同被引文献18

  • 1潘云鹤,王金龙,徐从富.数据流频繁模式挖掘研究进展[J].自动化学报,2006,32(4):594-602. 被引量:34
  • 2HAN J W, CHENG H, XIN D, et al. Frequent pattern mining:current status and future directions [ J]. Data Mining and Knowl-edge Discovery, 2007,15(1) :55 -86.
  • 3CHANG L, WANG T J, YANG D Q, et al. SeqStream: miningclosed sequential patterns over stream sliding windows [ C]// Pro-ceedings of the 2008 IEEE International Conference on Data Min-ing. Piscateway: IEEE, 2008: 83 -92.
  • 4CARSON K L,QUAMRUL I. DSTree: a tree structure for the min-ing of frequent sets from data streams[ C] // Proceedings of the 2006IEEE Internationa] Conference on Data Mining. Hong Kong; IEEE,2006 : 928 -932.
  • 5BARZAN M, HETAL T,CARLO Z. Verifying and mining frequentpatterns from large windows over data streams[ C]// Proceedings ofthe 24th IEEE International Conference on Data Enigneering. Pisca-taway: IEEE, 2008:179 -188.
  • 6LI H F, SUH-YIN L. Mining frequent itemsets over data streams u-sing efficient window sliding techniques[ J]. Expert Systems with Ap-plications, 2007, 36(2):1466 - 1477.
  • 7SYEDKT, CHOWDHURY F A, BYEONG-SOO J, et al. Slidingwindow-based frequent pattern mining over data streams [ JJ. Infor-mation Sciences, 2009, 179(22) : 3843 -3865.
  • 8CHANG J,LEE W. A sliding window method for finding recentlyfrequent itemsets over online data streams [ J]. Journal of InformationScience and Engineering. 2004, 20(4) :753 -762.
  • 9HAN J W, PEI J, YIN Y W. Mining frequent patterns withoutcandidate generation[ C] // Proceedings of the 2000 ACM SIGMODInternational Conference on Management of Data. New York:ACM, 2000, 29(2):1 -12.
  • 10SYED K T,CHOWDHURY F A,BYEONG-SOO J, et al. CP-Tree: a tree structure for single-pass frequent pattern mining[ C] //Advances in Knowledge Discovery and Data Mining: Proceedings of12th PKDDD, LNCS 5012. Osaka: Springer, 2008:1022-1027.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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