%0 Journal Article
%T Mining Frequent Patterns in Network Intrusion Detection<br>网络入侵检测系统中的频繁模式挖掘*
%A ZHAO Guan-jun
%A DING Hong
%A WANG Ze
%A <br>赵观军
%A 丁宏
%A 王泽
%J 计算机应用研究
%D 2006
%I 
%X In the network intrusion detection, Apriori algorithm is used to extract relative rules, but its processing precision and efficiency are not satisfactory. In order to resolve the problem, based on FP-growth, this paper proposes a new algorithm named PFP-growth, this algorithm applies an idea of divide and rule, makes good use of FP-tree, and eases the load of system when mining a large database, which makes its velocity improved obviously. Besides we design a new method to set min-support, which makes frequent patterns mined much precise.
%K Apriori
%K FP-growth<br>入侵检测
%K 关联规则
%K 频繁模式
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=9B945DE2C8CD2DAB&yid=37904DC365DD7266&vid=EA389574707BDED3&iid=B31275AF3241DB2D&sid=CDEBD1ACE0A4C1C1&eid=AE09EACBCD1B2A13&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=5