TOPSIL-Miner: an efficient algorithm for mining top-K significant itemsets over data streams
Authors:
- 19 May 2009
- journal article
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 23 (2) , 225-242
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A survey of top- k query processing techniques in relational database systemsACM Computing Surveys, 2008
- Online mining of frequent sets in data streams with error guaranteeKnowledge and Information Systems, 2007
- RFIMiner: A regression-based algorithm for recently frequent patterns in multiple time granularity data streamsApplied Mathematics and Computation, 2007
- Finding recently frequent itemsets adaptively over online transactional data streams,Information Systems, 2006
- Catch the moment: maintaining closed frequent itemsets over a data stream sliding windowKnowledge and Information Systems, 2006
- Mining frequent itemsets without support threshold: with and without item constraintsIEEE Transactions on Knowledge and Data Engineering, 2004
- Distributed top-k monitoring2003
- Identifying frequent items in sliding windows over on-line packet streams2003
- Mining frequent patterns without candidate generation2000
- Synopsis data structures for massive data sets1999