首页 | 本学科首页   官方微博 | 高级检索  
     检索      

A Fast Interactive Sequential Pattern Mining Algorithm
作者姓名:LU  Jie-Ping  LIU  Yue-bo  NI  wei-wei  LIU  Tong-ming  SUN  Zhi-hui
作者单位:[1]Department of Computer Science and Engineering,Southeast University, Nanjing 210096, Jiangsu,China [2]School of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang 212003,Jiangsu, China
基金项目:Supported by the National Natural Science Fundation of China (70371015) and the Natural Science Foundation of Jiangsu Province (BK2004058)
摘    要: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

关 键 词:数据库  数据挖掘  交互式挖掘算法  时序模式
文章编号:1007-1202(2006)01-0031-06
收稿时间:2005-04-20

A fast interactive sequential pattern mining algorithm
LU Jie-Ping LIU Yue-bo NI wei-wei LIU Tong-ming SUN Zhi-hui.A Fast Interactive Sequential Pattern Mining Algorithm[J].Wuhan University Journal of Natural Sciences,2006,11(1):31-36.
Authors:Lu Jie-ping  Liu Yue-bo  Ni Wei-wei  Liu Tong-ming  Sun Zhi-hui
Institution:(1) Department of Computer Science and Engineering, Southeast University, 210096 Nanjing Jiangsu, China;(2) School of Electronics and Information, Jiangsu University of Science and Technology, 212003 Zhenjiang Jiangsu, China
Abstract: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. Foundation item: Supported by the National Natural Science Fundation of China (70371015) and the Natural Science Foundation of Jiangsu Province (BK2004058) Biography: LU Jie-ping(1959-), male, Ph. D. candidate, Professor, research direction: data mining and knowledge discovery.
Keywords:data mining  sequential patterns  interactive mining  projection database
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号