一个快速的关联模式并行挖掘算法  

A Fast Parallel Mining Algorithm for Dependent Patterns

作　　者：张建军[1] 黄登斌[1] 蒋宏[2] 

机构地区：[1]海军工程大学理学院,武汉430033 [2]海军工程大学政治部,武汉430033

出　　处：《计算机与数字工程》2011年第12期1-4,共4页Computer & Digital Engineering

基　　金：国家自然科学基金项目(编号:60774029);海军工程大学自然科学基金项目(编号:HGDJJ05005)资助

摘　　要：由于目前大多数入侵侦测系统均基于专家知识的手工译码而构建,其更新十分缓慢和昂贵。显然从审计数据挖掘得出的频繁模式可以作为可靠的入侵侦测模型。因此,针对这一问题,文章提出一个快速有效的并行算法,该算法提取用来描述每一网络连接特征的扩充集合,并获知准确捕获入侵行为和正常活动的频繁模式,从而使得模型构建和不断更新简单易行。Since many current IDSs（Intrusion Detection Systems） are constructed by manual encoding of expert knowledge, updating of them are very slow and expensive. It is obvious that the frequent patterns mined from audit data can be used as reliable intrusion detection models. Aiming at this problem, this paper proposes an efficient parallel method to extract an extensive set of features that describe each network connection and learn frequent patterns that accurately capture the behavior of intrusions and normal activities, which are employed to facilitate model construction and incremental updates simply and easily.

关 键 词：入侵侦测 频繁模式 更新 并行算法 

分 类 号：TP316[自动化与计算机技术—计算机软件与理论]