Sciweavers

162 search results - page 4 / 33
» Parallel frequent set counting
Sort
View
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 11 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
DATAMINE
2006
230views more  DATAMINE 2006»
13 years 7 months ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
IPPS
2006
IEEE
14 years 1 months ago
Concurrent counting is harder than queuing
In both distributed counting and queuing, processors in a distributed system issue operations which are organized into a total order. In counting, each processor receives the rank...
Srikanta Tirthapura, Costas Busch
HPCA
2007
IEEE
14 years 8 months ago
Extending Multicore Architectures to Exploit Hybrid Parallelism in Single-thread Applications
Chip multiprocessors with multiple simpler cores are gaining popularity because they have the potential to drive future performance gains without exacerbating the problems of powe...
Hongtao Zhong, Steven A. Lieberman, Scott A. Mahlk...
PAKDD
2005
ACM
161views Data Mining» more  PAKDD 2005»
14 years 1 months ago
Online Algorithms for Mining Inter-stream Associations from Large Sensor Networks
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
K. K. Loo, Ivy Tong, Ben Kao