Parallelization of the Apriori Algorithm for the Search of Frequent Elements

Descripción del Articulo

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 O...

Descripción completa

Detalles Bibliográficos
Autores: Mamani Coaquira, Yonatan, Chumpisuca Carrion, Edith
Formato: artículo
Fecha de Publicación:2020
Institución:Universidad Nacional Micaela Bastidas de Apurímac
Repositorio:UNAMBA-Institucional
Lenguaje:español
OAI Identifier:oai:172.16.0.151:UNAMBA/952
Enlace del recurso:http://repositorio.unamba.edu.pe/handle/UNAMBA/952
Nivel de acceso:acceso abierto
Materia:Apriori algorithm
Frequent itemsets
Parallel algorithm
Openmp
https://purl.org/pe-repo/ocde/ford#1.02.01
Descripción
Sumario: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.
Parallelization of the Apriori Algorithm for the Search of Frequent Elements
Nota importante:
La información contenida en este registro es de entera responsabilidad de la institución que gestiona el repositorio institucional donde esta contenido este documento o set de datos. El CONCYTEC no se hace responsable por los contenidos (publicaciones y/o datos) accesibles a través del Repositorio Nacional Digital de Ciencia, Tecnología e Innovación de Acceso Abierto (ALICIA).

Ejemplares Similares