Sciweavers

45 search results - page 2 / 9
» Finding (Recently) Frequent Items in Distributed Data Stream...
Sort
View
VLDB
2010
ACM
144views Database» more  VLDB 2010»
13 years 3 months ago
Methods for finding frequent items in data streams
The frequent items problem is to process a stream of items and find all items occurring more than a given fraction of the time. It is one of the most heavily studied problems in d...
Graham Cormode, Marios Hadjieleftheriou
PVLDB
2008
105views more  PVLDB 2008»
13 years 4 months ago
Finding frequent items in data streams
Graham Cormode, Marios Hadjieleftheriou
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
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
14 years 5 months ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan