Back to Search
Start Over
TOPSIL-Miner: an efficient algorithm for mining top- K significant itemsets over data streams.
- Source :
- Knowledge & Information Systems; May2010, Vol. 23 Issue 2, p225-242, 18p, 1 Diagram, 3 Charts, 8 Graphs
- Publication Year :
- 2010
-
Abstract
- Frequent itemset mining over data streams becomes a hot topic in data mining and knowledge discovery in recent years, and has been applied to different areas. However, the setting of a minimum support threshold needs some domain knowledge. It will bring a lot of difficulties or much burden to users if the support threshold is not set reasonably. It is interesting for users to find top- K frequent itemsets over data streams. In this paper, a dynamical incremental approximate algorithm TOPSIL-Miner is presented to mine top- K significant itemsets in landmark windows. A new data structure, TOPSIL-Tree, is designed to store the potential significant itemsets and other data structures of maximum support list, ordered item list, TOPSET and minimum support list are devised to maintain information about mining results. Moreover, three optimal strategies are exploited to reduce time and space cost of the algorithm: (1) pruning trivial nodes in the current data stream, (2) promoting mining support threshold during mining process adaptively and heuristically, and (3) promoting pruning threshold dynamically. The accuracy of the algorithm is also analyzed. Extensive experiments are performed to evaluate the good effectiveness and the high efficiency and precision of the algorithm. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02191377
- Volume :
- 23
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Knowledge & Information Systems
- Publication Type :
- Academic Journal
- Accession number :
- 50132427
- Full Text :
- https://doi.org/10.1007/s10115-009-0211-5