Parallelization of the Apriori Algorithm for the Search of Frequent Elements
Palabras clave:
Apriori algorithm, parallel algorithm, openMPResumen
There is a wide variety of techniques that increase application performance by alleviating one or more of the most important problems with today's processors. In this work, the execution time, speedup and efficiency of the linear Apriori algorithm are shown as well as parallel with the use of OpenMP. By identifying the frequent elements of transactional databases, in processing 5 thousand records the time improves in 42,078 seconds of the algorithm with openMP compared to the sequential algorithm, in the execution 8 processor cores were used.
Descargas
Publicado
2021-05-15
Cómo citar
Mamani Coaquira, Y., & Chumpisuca Carrion, E. K. . (2021). Parallelization of the Apriori Algorithm for the Search of Frequent Elements. Micaela Revista De Investigación - UNAMBA, 1(1), Pág. 23–27. Recuperado a partir de http://revistas.unamba.edu.pe/index.php/micaela/article/view/29
Número
Sección
Artículos
Licencia
Derechos de autor 2020 https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.es
Esta obra está bajo una licencia internacional Creative Commons Atribución-NoComercial-SinDerivadas 4.0.