Asynchronous and anticipatory filter-stream based parallel algorithm for frequent itemset mining

Authors:
Adriano Veloso;Wagner Meira, Jr.;Renato Ferreira;Dorgival Guedes Neto;Srinivasan Parthasarathy
Affiliations:
Universidade Federal de Minas Gerais, Brazil;Universidade Federal de Minas Gerais, Brazil;Universidade Federal de Minas Gerais, Brazil;Universidade Federal de Minas Gerais, Brazil;The Ohio-State University
Venue:
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Year:
2004

Citing 0
Cited 3

Anteater: A Service-Oriented Architecture for High-Performance Data Mining

IEEE Internet Computing
The ParTriCluster algorithm for gene expression analysis

International Journal of Parallel Programming
AnthillSched: a scheduling strategy for irregular and iterative I/O-intensive parallel jobs

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

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 itemset mining process is represented as a data flow controlled by a series of producer and consumer components (called filters), and the data flow (communication) between such filters is made via streams. When production rate matches consumption rate, and communication overhead between producer and consumer filters is minimized, a high degree of asynchrony is achieved. Following this strategy, our algorithm employs an asynchronous candidate generation, and minimizes communication between filters by transferring only the necessary aggregated information. Another nice feature of our algorithm is a look forward approach which accelerates frequent itemset determination. Extensive evaluation shows the parallel performance and scalability of our algorithm.