DSM-FI: an efficient algorithm for mining frequent itemsets in data streams

Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee

研究成果: Article

41 引文 斯高帕斯(Scopus)

摘要

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.
原文English
頁(從 - 到)79-97
頁數9
期刊Knowledge and Information Systems
17
發行號1
DOIs
出版狀態Published - 十月 2008

指紋 深入研究「DSM-FI: an efficient algorithm for mining frequent itemsets in data streams」主題。共同形成了獨特的指紋。

  • 引用此