Sciweavers

36 search results - page 1 / 8
» Optimization of Frequent Itemset Mining on Multiple-Core Pro...
Sort
View
VLDB
2007
ACM
204views Database» more  VLDB 2007»
13 years 10 months ago
Optimization of Frequent Itemset Mining on Multiple-Core Processor
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
Eric Li, Li Liu
DAMON
2009
Springer
13 years 11 months ago
Frequent itemset mining on graphics processors
We present two efficient Apriori implementations of Frequent Itemset Mining (FIM) that utilize new-generation graphics processing units (GPUs). Our implementations take advantage ...
Wenbin Fang, Mian Lu, Xiangye Xiao, Bingsheng He, ...
IEEEHPCS
2010
13 years 3 months ago
Discovering closed frequent itemsets on multicore: Parallelizing computations and optimizing memory accesses
The problem of closed frequent itemset discovery is a fundamental problem of data mining, having applications in numerous domains. It is thus very important to have efficient par...
Benjamin Négrevergne, Alexandre Termier, Je...
FQAS
2006
Springer
99views Database» more  FQAS 2006»
13 years 8 months ago
Partition-Based Approach to Processing Batches of Frequent Itemset Queries
We consider the problem of optimizing processing of batches of frequent itemset queries. The problem is a particular case of multiple-query optimization, where the goal is to minim...
Przemyslaw Grudzinski, Marek Wojciechowski, Maciej...
ISCI
2008
116views more  ISCI 2008»
13 years 4 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu