计算机与现代化Issue(2)：8-10,18,4.DOI:10.3969/j.issn.1006-2475.2012.02.003
一种基于频繁序列树的增量式序列模式挖掘算法
An Incremental Mining Algorithm of Sequential Patterns Based on Frequent Sequence Tree
摘要
Abstract
This paper proposes an incremental mining algorithm of sequential patterns based on frequent sequence tree, called IS-FST, in order to solve the problem that the existed incremental mining algorithms can not make full use of the results of the previous mining, when the database is updated, the algorithms need to mine the database once again. ISFST uses the frequent sequence tree as the storage structure of the algorithm. When the database is updated, ISFST is divided into two kinds of situations to update the frequent sequence tree, and finally gets all sequential patterns. Experiments show that ISFST outperforms PrefixSpan and IncSpan in time cost.关键词
数据挖掘/序列模式/增量式挖掘/频繁序列树/投影数据库/剪枝策略Key words
data mining/sequential patterns/incremental mining/frequent sequence tree/projected database/pruning strategy分类
信息技术与安全科学引用本文复制引用
刘佳新..一种基于频繁序列树的增量式序列模式挖掘算法[J].计算机与现代化,2012,(2):8-10,18,4.基金项目
国家自然科学基金资助项目(61170190) （61170190）
秦皇岛市科学技术研究与发展计划项目(201001A018) （201001A018）
