Finding frequent items over sliding windows with constant update time

DOI10.1016/J.IPL.2009.01.027zbMATH Open1209.68661OpenAlexW2128785438MaRDI QIDQ991773FDOQ991773

Authors: Regant Y. S. Hung, Lap-Kei Lee, Hing-Fung Ting 

Publication date: 7 September 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.027

Recommendations

• Dynamically computing approximate frequency counts in sliding window over data stream
• Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
• An efficient algorithm for mining approximate frequent item over data streams
• Mining recent frequent itemsets in sliding windows over data streams
• Mining approximate frequent itemsets over data streams using window sliding techniques

zbMATH Keywords

approximation algorithmson-line algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cites Work

• Finding repeated elements
• An improved data stream summary: the count-min sketch and its applications
• Title not available (Why is that?)
• CR-precis: A Deterministic Summary Structure for Update Data Streams

Cited In (5)

• Approximating frequent items in asynchronous data stream over a sliding window
• Dynamically computing approximate frequency counts in sliding window over data stream
• How to catch \(L_2\)-heavy-hitters on sliding windows
• Approximating frequent items in asynchronous data stream over a sliding window
• Top-\(k\) frequent items and item frequency tracking over sliding windows of any size

This page was built for publication: Finding frequent items over sliding windows with constant update time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991773)