Parallelization of the Apriori Algorithm for the Search of Frequent Elements

Vista sencilla de ítem
dc.contributor.authorMamani Coaquira, Yonatan
dc.contributor.authorChumpisuca Carrion, Edith
dc.date.accessioned2025-11-07T16:59:54Z
dc.date.available2025-11-07T16:59:54Z
dc.date.issued2020-03-20
dc.description.abstractThere 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.
dc.formatapplication/pdf
dc.identifier.citationIEEE
dc.identifier.isbn2709-8990
dc.identifier.urihttps://hdl.handle.net/20.500.14195/1371
dc.language.isospa
dc.publisherUniversidad Nacional Micaela Bastidas de Apurímac
dc.publisher.countryPE
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/
dc.subjectApriori algorithm
dc.subjectFrequent itemsets
dc.subjectParallel algorithm
dc.subjectOpenmp
dc.subject.ocdehttps://purl.org/pe-repo/ocde/ford#1.02.01
dc.titleParallelization of the Apriori Algorithm for the Search of Frequent Elements
dc.typeinfo:eu-repo/semantics/article
dc.type.versioninfo:eu-repo/semantics/publishedVersion

Archivos

Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
A-Mamani-Coaquira-Yonatan.pdf
Tamaño:
221.9 KB
Formato:
Adobe Portable Document Format
Descargar
Bloque de licencias
Mostrando 1 - 1 de 1
No hay miniatura disponible
Nombre:
license.txt
Tamaño:
1.71 KB
Formato:
Item-specific license agreed to upon submission
Descripción:
Descargar

Colecciones

Artículos Publicados