Efficient Data Structures and Parallel Algorithms for Association Rules Discovery

Authors:
Christophe Cerin;Gay Gay;Gaël Le Mahec;Michel Koskas
Affiliations:
Université de Picardie Jules Verne;Université de Picardie Jules Verne;Université de Picardie Jules Verne;Université de Picardie Jules Verne
Venue:
ENC '04 Proceedings of the Fifth Mexican International Conference in Computer Science
Year:
2004

Citing 0
Cited 3

Using market basket analysis to integrate and motivate topics in discrete structures

Proceedings of the 37th SIGCSE technical symposium on Computer science education
Mining traces of large scale systems

ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
An Improved Brain Image Classification Technique with Mining and Shape Prior Segmentation Procedure

Journal of Medical Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of the data to deal with, parallel algorithms have been designed for reducing both the execution time and the number of repeated passes over the database in order to reduce, as much as possible, I/O overheads. In this paper, we introduce new approaches for the implementation of two basic algorithms for association rules discovery (namely Apriori and Eclat). Our approaches combine efficient data structures to code different key information (line indexes, candidates) and we exhibit how to introduce parallelism for processing such data-structures.