| 基于属性相关和时间约束的PrefixSpan算法 |
| |
| 引用本文： | 李春媚,蔡平良.基于属性相关和时间约束的PrefixSpan算法[J].计算机工程,2008,34(23):176-177. |
| |
| 作者姓名： | 李春媚 蔡平良 |
| |
| 作者单位： | 株洲职工大学,工业学校,信息技术系,株洲,412000 |
| |
| 摘 要： | 针对计算机入侵检测中网络安全审计数据的特点，提出一个改进的PrefixSpan算法，引入时间约束和属性相关的特征指导挖掘，应用M矩阵和Apriori特性减少投影数据库的数量，并缩减投影数据库规模，提高了序列模式挖掘的效率和有用性。通过检测一个网络审计记录的实验，进行结果分析。
|
| 关 键 词： | 序列模式挖掘 PrefixSpan算法 入侵检测 |
| 修稿时间： | |
PrefixSpan Algorithm Based on Attribute-relative and Time Constraints |
| |
| LI Chun-mei,CAI Ping-liang.PrefixSpan Algorithm Based on Attribute-relative and Time Constraints[J].Computer Engineering,2008,34(23):176-177. |
| |
| Authors: | LI Chun-mei CAI Ping-liang |
| |
| Affiliation: | (Department of Information Technology, Zhuzhou Adult College(Industry School), Zhuzhou 412000) |
| |
| 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. |
| |
| Keywords: | sequential patterns mining PrefixSpan algorithm intrusion detection |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
