Sciweavers

7 search results - page 1 / 2
» Asynchronous and Anticipatory Filter-Stream Based Parallel A...
Sort
View
PKDD
2004
Springer
131views Data Mining» more  PKDD 2004»
13 years 10 months ago
Asynchronous and Anticipatory Filter-Stream Based Parallel Algorithm for Frequent Itemset Mining
Abstract In this paper we propose a novel parallel algorithm for frequent itemset mining. The algorithm is based on the filter-stream programming model, in which the frequent item...
Adriano Veloso, Wagner Meira Jr., Renato Ferreira,...
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...
HIPC
2003
Springer
13 years 9 months ago
Parallel and Distributed Frequent Itemset Mining on Dynamic Datasets
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/...
Adriano Veloso, Matthew Eric Otey, Srinivasan Part...
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
PPOPP
2005
ACM
13 years 10 months ago
A sampling-based framework for parallel data mining
The goal of data mining algorithm is to discover useful information embedded in large databases. Frequent itemset mining and sequential pattern mining are two important data minin...
Shengnan Cong, Jiawei Han, Jay Hoeflinger, David A...