An Optimization of Apriori Algorithm through the Usage of Parallel I/O and Hints

Authors:
María S. Pérez;Ramón A. Pons;Félix García;Jesús Carretero;María L. Córdoba
Affiliations:
-;-;-;-;-
Venue:
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Year:
2002

Citing 2
Cited 1

Mining association rules between sets of items in large databases

SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
A New MultiAgent Based Architecture for High Performance I/O in Clusters

ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops

Adapting the weka data mining toolkit to a grid based environment

AWIC'05 Proceedings of the Third international conference on Advances in Web Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Association rules are very useful and interesting patterns in many data mining scenarios. Apriori algorithm is the best-known association rule algorithm. This algorithm interacts with a storage system in order to access input data and output the results. This paper shows how to optimize this algorithm adapting the underlying storage system to this problem through the usage of hints and parallel features.