An interactive sequential patterns mining algorithm based on frequent sequence tree, called ISPM, is proposed in this paper in order to reduce the time and space consumption generated by repeatly running mining algorithm in the process of the sequential pattern mining. ISFM uses the frequent sequence tree as the storage sturcture of the algorithm. The frequent sequence tree stores all the sequential patterns with its support that meet the frequent sequence tree support threshold in the database. When the support is changed,ISPM can reduce the time and space consumption through by reducing the number of frequent items that construct the projected databases to reduce the size of the projected databases. Experiments show that ISPM outperforms PrefixSpan and incSpan in time cost.%为了减少在序列模式挖掘过程中由于重复运行挖掘算法而产生的时空消耗,提出了一种基于频繁序列树的交互式序列模式挖掘算法(ISPM).ISPM算法采用频繁序列树作为序列存储结构,频繁序列树中存储数据库中满足频繁序列树支持度阈值的所有序列模式及其支持度信息.当支持度发生变化时,通过减少本次挖掘所要构造投影数据库的频繁项的数量来缩减投影数据库的规模,从而减少时空消耗.实验结果表明,ISPM算法在时问性能上优于PrefixSpan算法和IncSpan算法.
展开▼
