13 search results - page 1 / 3 » Finding frequent items over sliding windows with constant up... |
IPL
2010
14 years 10 months ago
2010
125
Voted
PODS
2006
ACM
16 years 10 days ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
115
Voted
JIIS
2008
15 years 5 days ago
2008
In this paper, we study the incremental update of Frequent Closed Itemsets (FCIs) over a sliding window in a high-speed data stream. We propose the notion of semi-FCIs, which is to...
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The past decade has witnessed many interesting algorithms for maintaining statistics over a data stream. This paper initiates a theoretical study of algorithms for monitoring distr...
IDA
2008
Springer
15 years 7 days ago
2008
Springer
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...