首页 | 本学科首页   官方微博 | 高级检索  
     

基于FP-Growth的入侵检测研究
引用本文:孙志强. 基于FP-Growth的入侵检测研究[J]. 微机发展, 2006, 16(12): 233-236
作者姓名:孙志强
作者单位:长沙理工大学计算机与通信工程学院 湖南长沙410076
摘    要:数据挖掘可以利用各种分析工具从海量数据中发现模型和数据间的关系并做出预测。为了解决入侵检测在不降低精度的同时提高检测速度的问题,提高算法的效率,将FP-Growth算法应用于入侵检测系统中,提出对FP-Growth算法改进FP-tree的头表结构并引入关键属性来挖掘原始审计数据中的频繁模式,实验结果表明改进后的算法比传统的关联算法在入侵检测中的应用效果更好。可以看出,将FP-Growth算法应用于入侵检测中是可行的。

关 键 词:入侵检测  关联规则  FP-Growth算法  数据挖掘
文章编号:1673-629X(2006)12-0233-04
修稿时间:2006-03-02

A Study of Intrusion Detection Based on Algorithm of FP-Growth
SUN Zhi-qiang. A Study of Intrusion Detection Based on Algorithm of FP-Growth[J]. Microcomputer Development, 2006, 16(12): 233-236
Authors:SUN Zhi-qiang
Abstract:Data mining can find the relation between pattern and data from the large number of data and the forecast will be made.In order to adapt to the real-time nature of the intrusion of testing requirements,and enhance the efficiency of algorithms,presented to the FP-Growth algorithms that improves FP-tree table structures and the introduction of key attributes to intrusion detection system.The experimental results showed improved algorithm has better results than traditional association algorithm in the application of intrusion detection.Accordig to the result,FP-Growth algorithm is useful to intrusion detection.
Keywords:intrusion detection  association rules  FP-Growth algorithm  data mining
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号