¹College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China
²Department of Computer Science, Yangzhou University, Yangzhou, China
³Department of Software Engineering, Yancheng Teachers University, Yancheng, China
⁴State Key Lab of Novel Software Technology, Nanjing University, Nanjing, China

---

Abstract—Mining frequent closed itemsets in data streams is an important task in stream data mining. In this paper, an efficient mining algorithm (denoted as EMAFCI) for frequent closed itemsets in data stream is proposed. The algorithm is based on the sliding window model, and uses a Bit Vector Table (denoted as BVTable) where the transactions and itemsets are recorded by the column and row vectors respectively. The algorithm first builds the BVTable 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 BVTable, the algorithm updates the BVTable for each sliding window. The frequent closed itemsets in the sliding window can be identified from the BVTable. Algorithms are also proposed to modify BVTable 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.

Index Terms—data mining, frequent closed itemsets, bit vector table, data stream, sliding window

[PDF]

Cite: Keming Tang, Caiyan Dai, Ling Chen, "An Efficient Mining Algorithm by Bit Vector Table for Frequent Closed Itemsets," Journal of Software vol. 6, no. 11, pp. 2121-2128, 2011.