A Fast Interactive Sequential Pattern Mining Algorithm

In order to reduce the computational and spatial complexity in rerunning algorithm of sequential patterns query, this paper proposes sequential patterns based and projection database based algorithm for fast interactive sequential patterns mining algorithm （FISP）, in which the number of frequent ite...

Full description

Saved in:
Bibliographic Details
Published in:Wuhan University journal of natural sciences 2006, Vol.11 (1), p.31-36
Main Authors: Lu, Jie-Ping, Liu, Yue-Bo, Ni, Wei-Wie, Liu, Tong-Ming, Sun, Zhi-Hui
Format: Article
Language:English
Subjects:
交互式挖掘算法
数据库
数据挖掘
时序模式
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In order to reduce the computational and spatial complexity in rerunning algorithm of sequential patterns query, this paper proposes sequential patterns based and projection database based algorithm for fast interactive sequential patterns mining algorithm （FISP）, in which the number of frequent items of the projection databases constructed by the correct mining which based on the previously mined sequences has been reduced. Furthermore, the algorithm＇s iterative running times are reduced greatly by using global-threshold. The results of experiments testify that FISP outperforms PrefixSpan in interactive mining
ISSN:1007-1202
1993-4998
DOI:10.1007/bf02831699