期刊文献+

基于聚集矩阵的审计日志关联规则更新算法 被引量:1

Updating Association Rules of the Audit Record Based on Information Collecting Matrix
下载PDF
导出
摘要 针对审计日志记录的特性,本文提出了一种基于聚集信息矩阵的高效增量式关联规则的挖掘算法,并解决了当最小支持度改变以及审计数据动态更新时相应的关联规则的更新问题。算法提高了审计日志数据库关联规则挖掘的效率,更加适用于入侵检测系统,能基本满足实时入侵检测系统的需要。 Corresponding to characteristic of the audit record, this paper proposes a high efficiency incremental association mining algorithm based on information collecting matrix. The algorithm resolve the problem that how to update the association rules in a database when minimum support changed or new transactions are added to the database. The algorithm improves the efficiency of the association mining, can fulfill the request if the real time system and apply to intrusion detection system.
出处 《微计算机信息》 北大核心 2006年第10X期49-51,71,共4页 Control & Automation
基金 华为基金"无线流媒体版权保护技术研究"资助(YJCB2004009NP) 教育部博士点基金资助课题(No:20040487009)
关键词 入侵检测 关联规则挖掘 聚集信息矩阵 关联向量 Intrusion detection,Association mining,Information collecting matrix,Association vector
  • 相关文献

参考文献9

  • 1W.Lee,S.J.Stolfo,and K.W.Mok.Mining in a data-flow environment:Experience in network intrusion detection[A].In:Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery&Data Mining (KDD-99)[C],1999.
  • 2W.Lee and S.J.Stolfo.Data mining approaches for intrusion detection[A].In:Proceedings of the 7th USENIX Security Symposium[C],San Antonio,TX,1998.
  • 3R.Agrawal,T.Imielinski,and A.Swami.Mining association rules between sets of items in large databases.In Proc.of ACMSIGMOD,May 1993,pages 207-216.
  • 4Han J,Pei J,Yin Y.Mining Frequent Patterns Without Candidate Generation.In proceeding of ACM SIGMOD' 00[C],May,2000..
  • 5Brin,S.,Motwani,R.,Ullman,J.D.,Tsur,S.,"Dynamic Itemset Counting and Implication Rules for Market Basket Data," Proc.of the ACM SIGMOD,1997,pp.255-264.
  • 6D.Cheung,J.Han,V.Ng,and C.Y.Wong.Maintenance of discovered association rules in large databases:An incremental updating technique.In Data Engineering,pages 106-114,February 1996.
  • 7Chang,C.H.,and Yang,S.H.,"Enhancing SWF for Incremental Association Mining by Iternset Maintenance," Proceedings of the seventh Pacific-Asia Conference on Knowledge Discovery and Data Mining,Korea,2003,pp.301-312.
  • 8Lee,C.H.,Lin,C.R.,and Chen,M.S.,"Sliding-Window Filtering:An Efficient Algorithm for Incremental Mining,"Proceedings of the tenth international conference on Information and knowledge management,2001,pp.263-270.
  • 9陈凯,冯全源.基于矩阵伪投影策略的频繁项集挖掘方法[J].微计算机信息,2005,21(11X):85-87. 被引量:8

二级参考文献8

  • 1R. Agrawal, and R. Srikant. Fast Algorithms for Mining Association Rules [A]. In Proceeding of the 20th VLDB Conferencei [C], Santiago,Chile, 1994.
  • 2A. Silbersehatz, and A. Tuzhilin. What Make Patterns Interesting in Knowledge Diseovery Systems [J]. In IEEE Transaetion on Knowledge and Data Engineering, Dec. 1996.
  • 3J. Han, J. Pei, and Y. Yin. Mining Frequent Patterns without Candidate Generation [A]. In Proceeding of ACM SIGMOD" 00 [C], May. 2000.
  • 4M. J. Zaki, and C. Hsiao. CHARM: An Efficient Alogrithm for Closed Itemset Mining [A]. In SDM" 02 [C], Apr. 2002.
  • 5L. Li, and F. Jin. A New Algorithm form Mining Frequent Pattern [A].Journal of Southwest Jiaotong University, May. 2002.
  • 6J. Han and M. Kamber. Data Mining: Concepts and Techniques [M].Morgan Kaufmann Publishers, San Francisco, CA, 2001.
  • 7宋余庆,朱玉全,孙志挥,陈耿.基于FP-Tree的最大频繁项目集挖掘及更新算法[J].软件学报,2003,14(9):1586-1592. 被引量:164
  • 8王晓峰,王天然,赵越.一种自顶向下挖掘长频繁项的有效方法[J].计算机研究与发展,2004,41(1):148-155. 被引量:27

共引文献7

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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