Top-k frequent items and item frequency tracking over sliding windows of any size
From MaRDI portal
Publication:2201636
DOI10.1016/J.INS.2018.09.066zbMATH Open1442.68215OpenAlexW2895601167WikidataQ129140546 ScholiaQ129140546MaRDI QIDQ2201636FDOQ2201636
Tingjian Ge, Yao Ge, Xuanming Liu, Chunyao Song
Publication date: 29 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.09.066
Cites Work
- Title not available (Why is that?)
- Finding repeated elements
- An improved data stream summary: the count-min sketch and its applications
- Probability and Computing
- Maintaining Stream Statistics over Sliding Windows
- Database Theory - ICDT 2005
- Mining frequent items in data stream using time fading model
- An on-line algorithm for fitting straight lines between data ranges
- Saving human lives: what complexity science and information systems can contribute
Cited In (1)
This page was built for publication: Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201636)