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 inWuhan University journal of natural sciences Vol. 11; no. 1; pp. 31 - 36
Main Authors Lu, Jie-Ping, Liu, Yue-Bo, Ni, Wei-Wie, Liu, Tong-Ming, Sun, Zhi-Hui
Format Journal Article
LanguageEnglish
Published School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang 212003, Jiangsu, China%School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang 212003, Jiangsu, China%Department of Computer Science and Engineering, Southeast University, Nanjing 210096, Jiangsu,China 2006
Department of Computer Science and Engineering, Southeast University, Nanjing 210096, Jiangsu,China
Subjects
Online AccessGet full text
ISSN1007-1202
1993-4998
DOI10.1007/bf02831699

Cover

More Information
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
Bibliography:interactive mining
projection database
data mining
data mining; sequential patterns; interactive mining; projection database
sequential patterns
42-1405/N
TP311.13
SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
ISSN:1007-1202
1993-4998
DOI:10.1007/bf02831699