Sciweavers

Share
28 search results - page 1 / 6
» Mining frequent items in a stream using flexible windows
Sort
View
IDA
2008
Springer
12 years 3 months ago
Mining frequent items in a stream using flexible windows
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 ...
Toon Calders, Nele Dexters, Bart Goethals
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
12 years 7 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of ļ¬nding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the properties of an item, the maxfrequen...
Hoang Thanh Lam, Toon Calders
PODS
2006
ACM
217views Database» more  PODS 2006»
13 years 3 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
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 ...
Lap-Kei Lee, H. F. Ting
ICDE
2008
IEEE
192views Database» more  ICDE 2008»
13 years 4 months ago
Verifying and Mining Frequent Patterns from Large Windows over Data Streams
Mining frequent itemsets from data streams has proved to be very difficult because of computational complexity and the need for real-time response. In this paper, we introduce a no...
Barzan Mozafari, Hetal Thakkar, Carlo Zaniolo
ICDM
2006
IEEE
227views Data Mining» more  ICDM 2006»
12 years 9 months ago
Incremental Mining of Sequential Patterns over a Stream Sliding Window
Incremental mining of sequential patterns from data streams is one of the most challenging problems in mining data streams. However, previous work of mining sequential patterns fr...
Chin-Chuan Ho, Hua-Fu Li, Fang-Fei Kuo, Suh-Yin Le...
books