Efficient mining of temporal emerging itemsets from data streams

doi:10.1016/j.eswa.2007.10.040

Efficient mining of temporal emerging itemsets from data streams

2009-01-01

11

PRE

AI

DOI：10.1016/j.eswa.2007.10.040

原文链接

原文求助

摘要

En 中文

In this paper, we propose a new method, namely EFI-Mine, for mining temporal emerging frequent itemsets from data streams efficiently and effectively. The temporal emerging frequent itemsets are those that are infrequent in the current time window of data stream but have high potential to become frequent in the subsequent time windows. Discovery of emerging frequent itemsets is an important process for mining interesting patterns like association rules from data streams. The novel contribution of EFI-Mine is that it can effectively identify the potential emerging itemsets such that the execution time can be reduced substantially in mining all frequent itemsets in data streams. This meets the critical requirements of time and space efficiency for mining data streams. The experimental results show that EFI-Mine can find the emerging frequent itemsets with high precision under different experimental conditions and it performs scalable in terms of execution time. (C) 2007 Elsevier Ltd. All rights reserved.

Keyword:

Temporal emerging frequent itemsets

Data streams

Association rules

Efficient mining of temporal emerging itemsets from data streams

摘要

AI总结

期刊

机构

引用论文