摘要
研究了审计数据挖掘中一种不产生候选频集的高速算法——FPgrowth算法;随后,针对入侵检测的应用环境,提出了FPgrowth算法在入侵检测应用中的改进方案。
A high-speed algorithm named FP-growth that doesn't generate a candidate frequent item set in the auditing datamining is studied According to the application in an intrusion detection system, several improved methods for the application of FP-growth algorithm in intrusion detection are discussed.
出处
《武汉理工大学学报（信息与管理工程版）》
CAS
2004年第5期5-9,共5页
Journal of Wuhan University of Technology：Information & Management Engineering
