Top-k frequent items and item frequency tracking over sliding windows of any size
- 1 February 2019
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 475, 100-120
Abstract
No abstract availableKeywords
Funding Information
- NSFC (61702285, 61772289)
- National Science Foundation (IIS-1149417, IIS-1633271)
This publication has 17 references indexed in Scilit:
- Approximate TF–IDF based on topic extraction from massive message stream using the GPUInformation Sciences, 2015
- Saving Human Lives: What Complexity Science and Information Systems can ContributeJournal of Statistical Physics, 2014
- Mining frequent items in data stream using time fading modelInformation Sciences, 2014
- Finding top-k elements in a time-sliding windowEvolving Systems, 2010
- Methods for finding frequent items in data streamsThe VLDB Journal, 2009
- Methods for mining frequent items in data streams: an overviewKnowledge and Information Systems, 2009
- An improved data stream summary: the count-min sketch and its applicationsJournal of Algorithms, 2005
- Maintaining Stream Statistics over Sliding WindowsSIAM Journal on Computing, 2002
- Finding repeated elementsScience of Computer Programming, 1982
- An on-line algorithm for fitting straight lines between data rangesCommunications of the ACM, 1981