Sciweavers

388 search results - page 19 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
DAMON
2009
Springer
14 years 2 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, ...
VLDB
2007
ACM
204views Database» more  VLDB 2007»
14 years 1 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
IJCNN
2007
IEEE
14 years 1 months ago
An Associative Memory for Association Rule Mining
— Association Rule Mining is a thoroughly studied problem in Data Mining. Its solution has been aimed for by approaches based on different strategies involving, for instance, the...
Vicente O. Baez-Monroy, Simon O'Keefe
KDD
2000
ACM
118views Data Mining» more  KDD 2000»
13 years 11 months ago
Generating non-redundant association rules
The traditional association rule mining framework produces many redundant rules. The extent of redundancy is a lot larger than previously suspected. We present a new framework for...
Mohammed Javeed Zaki
COMPUTE
2010
ACM
13 years 12 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy