Sciweavers

82 search results - page 1 / 17
» Dynamically maintaining frequent items over a data stream
Sort
View
CIKM
2003
Springer
13 years 10 months ago
Dynamically maintaining frequent items over a data stream
Cheqing Jin, Weining Qian, Chaofeng Sha, Jeffrey X...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 8 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
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
14 years 6 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...
IEAAIE
2009
Springer
13 years 11 months ago
An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream
Data mining refers to the process of revealing unknown and potentially useful information from a large database. Frequent itemsets mining is one of the foundational problems in dat...
Show-Jane Yen, Yue-Shi Lee, Cheng-Wei Wu, Chin-Lin...
KAIS
2006
110views more  KAIS 2006»
13 years 4 months ago
Catch the moment: maintaining closed frequent itemsets over a data stream sliding window
Yun Chi, Haixun Wang, Philip S. Yu, Richard R. Mun...