节点文献
面向审计的严格约束的序列挖掘算法
Audit-oriented sequence mining algorithm with strict constraints
【摘要】 网络安全审计数据具有很强的时间特征。提出了面向审计基于SPAD算法的严格约束的序列挖掘快速算法(Sequence mIning with Strict Constraints,SISC),它充分利用了序列数据的时间和属性相关的特征指导挖掘,并使用严格的属性模式裁减概念等价类,提高了规则的有用度。最后在真实的审计数据集上的试验结果表明,SISC的效率优于SPADE,尤其当项的个数远大于属性的个数的时候。
【Abstract】 Security audit data has obvious time feature, but many seqnence pattern mining algorityms consider little about the time feature of sequence data. A fast algorithm SISC(Sequence mIning with Strict Constraints) was presented based on SPADE. Time and attribute-relative features were utilized to lead the mining process, and strict attribute schemes were used to prune sequential rules. Experiments on a real-world audit dataset show that SISC outperforms SPADE, especially when the number of attributes is far less than the number of attribute values.
【Key words】 data mining; sequential mining; security audit; concept lattice;
- 【文献出处】 计算机应用 ,Journal of Computer Applications , 编辑部邮箱 ,2006年03期
- 【分类号】TP301.6
- 【被引频次】3
- 【下载频次】107