Top-\(k\) frequent items and item frequency tracking over sliding windows of any size

DOI10.1016/j.ins.2018.09.066zbMath1442.68215OpenAlexW2895601167WikidataQ129140546 ScholiaQ129140546MaRDI QIDQ2201636

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

zbMATH Keywords

sliding windowdata streamitem frequency trackingtop-\(k\) frequent items

Mathematics Subject Classification ID

Data structures (68P05) Computational aspects of data analysis and big data (68T09)

Related Items (1)

Dual incremental fuzzy schemes for frequent itemsets discovery in streaming numeric data

Cites Work

• Unnamed Item
• Mining frequent items in data stream using time fading model
• Finding repeated elements
• Saving human lives: what complexity science and information systems can contribute
• An on-line algorithm for fitting straight lines between data ranges
• An improved data stream summary: the count-min sketch and its applications
• Maintaining Stream Statistics over Sliding Windows
• Database Theory - ICDT 2005
• Probability and Computing

This page was built for publication: Top-\(k\) frequent items and item frequency tracking over sliding windows of any size