Name
Abstract | ||
|---|---|---|
Mining itemsets is a central task in data mining, both in the batch and the streaming paradigms. While robust, efficient, and well-tested implementations exist for batch mining, hardly any publicly available equivalent exists for the streaming scenario. The lack of an efficient, usable tool for the task hinders its use by practitioners and makes it difficult to assess new research in the area. To alleviate this situation, we review the algorithms described in the literature, and implement and evaluate the IncMine algorithm by Cheng, Ke and Ng [J. Intell. Inf. Syst. 31(3) (2008), 191215] for mining frequent closed itemsets from data streams. Our implementation works on top of the MOA (Massive Online Analysis) stream mining framework to ease its use and integration with other stream mining tasks. We provide a PAC-style rigorous analysis of the quality of the output of IncMine as a function of its parameters; this type of analysis is rare in pattern mining algorithms. As a by-product, the analysis shows how one of the user-provided parameters in the original description can be removed entirely while retaining the performance guarantees. Finally, we experimentally confirm both on synthetic and real data the excellent performance of the algorithm, as reported in the original paper, and its ability to handle concept drift. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.3233/AIC-140615 | AI Commun. |
Keywords | DocType | Volume |
data streams,moa,itemset mining,data mining,stream mining | Conference | 28 |
Issue | ISSN | Citations |
1 | 0921-7126 | 5 |
PageRank | References | Authors |
0.44 | 18 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Massimo Quadrana | 1 | 239 | 13.89 |
| Albert Bifet | 2 | 2659 | 140.83 |
| Ricard Gavaldà | 3 | 1265 | 81.30 |