www-ai.cs.tu-dortmund.de/LEHRE/FACHPROJEKT/SS12/paper/counting/gothals2007.pdf
be a stream and summary(St) = [(p1, a1), . . . , (pr, ar)]. Then,
a1
p2 − p1 <
a2
p3 − p2 < . . . <
ar−1
pr − pr−1 <
ar
t − pr + 1
and
freq(A, St[p1, t]) < freq(A, St[p2, t]) <
. . . < freq(A, St[pr, t]) [...] L] be the maximal window for the itemset A. Then, for any p, r with p < q ≤ r: freq(A, S[p, q − 1]) < freq(A, S[q, r]).
Proof 1 Let B1 denote S[p, q − 1], B2 denote S[q, r], and B3 denote S[r + 1, L]. Because [...] summary.
Let St be a stream with St = [(p1, a1), . . . , (pr, ar)], and suppose that
freq(a, St[p1, t]) = a1 + . . . + ar
t − p1 + 1 < minfreq .
Then we can safely remove (p1, a1) from the left-side of the summary; …