Mining frequent items in data stream using time fading model
Authors:
- Ling ChenLCLing Chen
- Qingling MeiQMQingling Mei
- 1 February 2014
- journal article
- Published by Elsevier in Information Sciences
- Vol. 257, 54-69
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Best position algorithms for efficient top-k query processingInformation Systems, 2011
- Ranking uncertain sky: The probabilistic top-k skyline operatorInformation Systems, 2011
- Finding top-k elements in data streamsInformation Sciences, 2010
- Stream data clustering based on grid density and attractionACM Transactions on Knowledge Discovery From Data, 2009
- Frequent items in streaming data: An experimental evaluation of the state-of-the-artData & Knowledge Engineering, 2009
- Deterministic algorithms for sampling count dataData & Knowledge Engineering, 2007
- An Efficient Algorithm for Mining Approximate Frequent Item over Data StreamsJournal of Software, 2007
- Space-efficient online computation of quantile summariesACM SIGMOD Record, 2001
- New sampling-based summary statistics for improving approximate query answersACM SIGMOD Record, 1998
- Finding repeated elementsScience of Computer Programming, 1982