Top-k frequent items and item frequency tracking over sliding windows of any size
From MaRDI portal
Publication:2201636
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
Cites work
- An improved data stream summary: the count-min sketch and its applications
- An on-line algorithm for fitting straight lines between data ranges
- Database Theory - ICDT 2005
- Finding repeated elements
- scientific article; zbMATH DE number 2119720 (Why is no real title available?)
- Maintaining Stream Statistics over Sliding Windows
- Mining frequent items in data stream using time fading model
- Probability and Computing
- Saving human lives: what complexity science and information systems can contribute
Cited in
(6)- Dual incremental fuzzy schemes for frequent itemsets discovery in streaming numeric data
- Higher-Accuracy for Identifying Frequent Items over Real-Time Packet Streams
- Time- and space-efficient sliding window top-k query processing
- Database Theory - ICDT 2005
- Efficiently answering top-k frequent term queries in temporal-categorical range
- Finding frequent items over sliding windows with constant update time
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)