We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
DSM-FI: an efficient algorithm for mining frequent itemsets in data streams.
- Authors
Li, Hua-Fu; Shan, Man-Kwan; Lee, Suh-Yin
- Abstract
Online mining of data streams is an important data mining problem with broad applications. However, it is also a difficult problem since the streaming data possess some inherent characteristics. In this paper, we propose a new single-pass algorithm, called DSM-FI (data stream mining for frequent itemsets), for online incremental mining of frequent itemsets over a continuous stream of online transactions. According to the proposed algorithm, each transaction of the stream is projected into a set of sub-transactions, and these sub-transactions are inserted into a new in-memory summary data structure, called SFI-forest (summary frequent itemset forest) for maintaining the set of all frequent itemsets embedded in the transaction data stream generated so far. Finally, the set of all frequent itemsets is determined from the current SFI-forest. Theoretical analysis and experimental studies show that the proposed DSM-FI algorithm uses stable memory, makes only one pass over an online transactional data stream, and outperforms the existing algorithms of one-pass mining of frequent itemsets.
- Subjects
ALGORITHMS; DATA mining; DATABASE searching; ONLINE data processing; DATA structures; COMPUTER input design
- Publication
Knowledge & Information Systems, 2008, Vol 17, Issue 1, p79
- ISSN
0219-1377
- Publication type
Article
- DOI
10.1007/s10115-007-0112-4