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

DOI10.1016/J.INS.2018.09.066zbMATH Open1442.68215OpenAlexW2895601167WikidataQ129140546 ScholiaQ129140546MaRDI QIDQ2201636FDOQ2201636

Authors: Chunyao Song, Xuanming Liu, Tingjian Ge, Yao Ge 

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

Recommendations

• Finding frequent items over sliding windows with constant update time
• Database Theory - ICDT 2005
• Dynamically computing approximate frequency counts in sliding window over data stream
• Mining recent frequent itemsets in sliding windows over data streams
• Mining frequent items in data stream using time fading model

zbMATH Keywords

data streamsliding windowitem frequency trackingtop-\(k\) frequent items

Mathematics Subject Classification ID

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

Cites Work

• Finding repeated elements
• An improved data stream summary: the count-min sketch and its applications
• Title not available (Why is that?)
• 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 (4)

• Database Theory - ICDT 2005
• Dual incremental fuzzy schemes for frequent itemsets discovery in streaming numeric data
• Finding frequent items over sliding windows with constant update time
• Higher-Accuracy for Identifying Frequent Items over Real-Time Packet Streams

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)