Paper Title:
ItemListFCI:An Algorithm for Mining Closed Frequent Itemsets Based on Bit Table
  Abstract

Mining closed frequent itemsets in data streams is an important task in stream data mining. Most of the traditional algorithms for mining closed frequent itemsets are Apriori-based which find the frequent itemsets from large amount of candidates, and needs a great deal of time and space. In this paper, an algorithm ItemListFCI for mining closed frequent itemsets in data stream is proposed. The algorithm is based on the sliding window model, and uses a ItemList where the transactions and itemsets are recorded by the column and row vectors respectively. The algorithm first builds the ItemList for the first sliding window. Frequent closed itemsets can be detected by pair-test operations on the binary numbers in the Table. After building the first ItemList, the algorithm updates the ItemList for each sliding window. The frequent closed itemsets in the sliding window can be identified from the ItemList. Algorithms are also proposed to modify ItemList when adding and deleting a transaction. The experimental results on synthetic and real data sets indicate that the proposed algorithm needs less CPU time and memory than other similar methods.

  Info
Periodical
Edited by
Ran Chen
Pages
3159-3163
DOI
10.4028/www.scientific.net/AMM.44-47.3159
Citation
K. M. Tang, C. Y. Dai, L. Chen, "ItemListFCI:An Algorithm for Mining Closed Frequent Itemsets Based on Bit Table", Applied Mechanics and Materials, Vols. 44-47, pp. 3159-3163, 2011
Online since
December 2010
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