作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (23): 176-177,. doi: 10.3969/j.issn.1000-3428.2008.23.063

• 安全技术 • 上一篇    下一篇

基于属性相关和时间约束的PrefixSpan算法

李春媚,蔡平良   

  1. (株洲职工大学(工业学校)信息技术系,株洲 412000)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-12-05 发布日期:2008-12-05

PrefixSpan Algorithm Based on Attribute-relative and Time Constraints

LI Chun-mei, CAI Ping-liang   

  1. (Department of Information Technology, Zhuzhou Adult College(Industry School), Zhuzhou 412000)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-12-05 Published:2008-12-05

摘要: 针对计算机入侵检测中网络安全审计数据的特点,提出一个改进的PrefixSpan算法,引入时间约束和属性相关的特征指导挖掘,应用M矩阵和Apriori特性减少投影数据库的数量,并缩减投影数据库规模,提高了序列模式挖掘的效率和有用性。通过检测一个网络审计记录的实验,进行结果分析。

关键词: 序列模式挖掘, PrefixSpan算法, 入侵检测

Abstract: An improved PrefixSpan algorithm based on time constraints and attribute-relative is developed to fit into the network audit data of computer intrusion detection. The algorithm applies the triangular matrix M to reduce the number of projected databases and the Apriori checking to reduce the size of projected databases. It enhances effectiveness and usefulness of sequential patterns mining. The experiment of dealing with a computer network audit database gives the application and result analysis of the algorithm.

Key words: sequential patterns mining, PrefixSpan algorithm, intrusion detection

中图分类号: