Sciweavers

87 search results - page 2 / 18
» Distributed Monitoring of Frequent Items
Sort
View
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 5 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
COMPUTE
2010
ACM
13 years 9 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
SAC
2006
ACM
13 years 11 months ago
A probability analysis for candidate-based frequent itemset algorithms
This paper explores the generation of candidates, which is an important step in frequent itemset mining algorithms, from a theoretical point of view. Important notions in our prob...
Nele Dexters, Paul W. Purdom, Dirk Van Gucht
ADMA
2008
Springer
186views Data Mining» more  ADMA 2008»
13 years 11 months ago
A Distributed Privacy-Preserving Association Rules Mining Scheme Using Frequent-Pattern Tree
Association rules mining is a frequently used technique which finds interesting association and correlation relationships among large set of data items which occur frequently toge...
Chunhua Su, Kouichi Sakurai
PARMA
2004
191views Database» more  PARMA 2004»
13 years 6 months ago
Identifying Most Predictive Items
Abstract. Frequent itemsets and association rules are generally accepted concepts in analyzing item-based databases. The Apriori-framework was developed for analyzing categorical d...
Markus Wawryniuk, Daniel A. Keim