期刊文献+

基于数据挖掘的入侵检测 被引量:1

Data Mining Based Intrusion Detection
下载PDF
导出
摘要 结合入侵检测系统,比较各种数据挖掘算法,笔者发现最适合用于挖掘规则的是关联规则和聚类分析。基于此,笔者重点介绍和分析了Apriori算法和K-means算法,然后改进了传统的Apriori算法,最后应用联合数据挖掘思想,进一步提高了算法的执行效率。基于数据挖掘的入侵检测系统能有效地提高检测效率和降低误检率,具备一定的研究意义和实用价值。 By comparing various data mining algorithms to intrusion detection system,the authors found that association rules and clustering analysis are the most suitable for mining rules.Based onthis,the authors focus on introducing and analyzing the Apriori algorithm and K-means algorithm,then improves the traditional Apriori algorithm,and finally applies the idea of joint data mining to further improve the efficiency of the algorithm.Data mining based intrusion detection system can effectively improve the detection rate and reduce the false detection rate,which has certain research significance and practical value.
作者 韩洋 邓一萍 穆穆 Han Yang;Deng Yiping;Mu Mu(School of Information Engineering,Minzu University of China,Beijing 100081,China)
出处 《信息与电脑》 2020年第2期111-112,115,共3页 Information & Computer
关键词 数据挖掘 入侵检测 关联规则 聚类 data mining intrusion detection association rule cluster analysis
  • 相关文献

参考文献4

二级参考文献69

  • 1徐章艳,刘美玲,张师超,卢景丽,区玉明.Apriori算法的三种优化方法[J].计算机工程与应用,2004,40(36):190-192. 被引量:71
  • 2曾万聃,周绪波,戴勃,常桂然,李春平.关联规则挖掘的矩阵算法[J].计算机工程,2006,32(2):45-47. 被引量:33
  • 3钱军,万里勇.网络与信息安全保护的分析和策略[J].电脑知识与技术,2008,(1).
  • 4AGRWAL R, SRIKAN R. Fast algorithms for mining association rules in large databases [ C]//Proceedings of the 20th International Conference on Very Large Data Bases. San Francisco: Morgan Kaufmann Publishers, 1994:487 - 499.
  • 5PARK J S, CHEN M S, YU P S. An effective Hash based algorithm for mining association rules [ C]//Proceedings of International Conference on the Special Interest Group on Management of Data. New York: ACM, 1995:175 - 186.
  • 6HAN J, FU Y. Discovery of multiple-level association rules from large databases [ C]//Proceedings of the 20th International Conference on Very Large Database. Zuich, Switzerland: [ s. n. ], 1995: 420 - 431.
  • 7SAVASERE A, OMIECINSKI E, NAVATHE S. An efficient algorithm for mining association rules in large databases [ C]// Proceedings of the 21st International Conference on Very Large Database. New York: ACM, 1995:432-443.
  • 8TOLVONEN H . Sampling large databases for association rules [C]// Proceedings of the 22nd International Conference on Very Large Database. Bombay, India [ s. n. ], 1996:134 - 145.
  • 9BRIN S. Dynamic itemset counting and implication rules for market basket analysis [ C l// Proceedings of International Conference on the Special Interest Group on Management of Data. New York ACM, 1997:255-264.
  • 10SCHLIMMER J. Mushroom data set[ DB/OL]. [ 2010 - 04 - 30]. http://archive, ics. uci. edu,/ml/machine-learning-databases/mushroom/agaricus-lepiota, data.

共引文献328

同被引文献6

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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