Paper Title:
Incremental Mining Algorithm of Sequential Patterns Based on Frequent Sequence Tree
  Abstract

At present, the existed incremental mining algorithms can not make full use of the results of the previous mining. When the support is changed, the algorithms need to mine the database once again. In this paper, we propose an incremental mining algorithm of sequential patterns based on frequent sequence tree, called IMFST. When the database is updated and the support is changed, IMFST is divided into four kinds of situations to update the frequent sequence tree, and finally gets all sequential patterns. IMFST uses two kinds of pruning strategies to reduece the size of the projected databases. When the support is changed and the support is no less than the frequent sequence tree support threshold, IMFST can find all the sequential patterns without mining the database once again. Experiments show that IMFST outperforms PrefixSpan and IncSpan in time cost.

  Info
Periodical
Advanced Materials Research (Volumes 225-226)
Edited by
Helen Zhang, Gang Shen and David Jin
Pages
422-427
DOI
10.4028/www.scientific.net/AMR.225-226.422
Citation
J. X. Liu, S. T. Yan, J. D. Ren, "Incremental Mining Algorithm of Sequential Patterns Based on Frequent Sequence Tree", Advanced Materials Research, Vols. 225-226, pp. 422-427, 2011
Online since
April 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Zhong Ping Zhang, Yong Xin Liang
Abstract:This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window...
1032
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910
Authors: Hui Wang
Chapter 5: Numerical Methods, Computation Methods and Algorithms for Modeling, Simulation and Optimization, Data Mining and Data Processing
Abstract:We present a new algorithm for mining maximal frequent itemsets, MaxMining, from big transaction databases. MaxMining employs the depth-first...
1765