Sciweavers

145 search results - page 1 / 29
» Mining discriminative items in multiple data streams
Sort
View
WWW
2010
ACM
13 years 3 months ago
Mining discriminative items in multiple data streams
Zhenhua Lin, Bin Jiang, Jian Pei, Daxin Jiang
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 9 months ago
Mining top-k frequent items in a data stream with flexible sliding windows
We study the problem of finding 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
ICDM
2010
IEEE
164views Data Mining» more  ICDM 2010»
13 years 3 months ago
On Finding Similar Items in a Stream of Transactions
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
Andrea Campagna, Rasmus Pagh
ACSW
2004
13 years 6 months ago
Cost-Efficient Mining Techniques for Data Streams
A data stream is a continuous and high-speed flow of data items. High speed refers to the phenomenon that the data rate is high relative to the computational power. The increasing...
Mohamed Medhat Gaber, Shonali Krishnaswamy, Arkady...
IDA
2008
Springer
13 years 5 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