An Interactive Sequential Patterns Mining Algorithm Based on Frequent Sequence Tree
Jiaxin Liu · Computer Technology and Development · 2012
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.ISPM 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.