Parallelization of the Apriori Algorithm for the Search of Frequent Elements

Mamani Coaquira, Yonatan; Chumpisuca Carrion, Edith

Repository
→
Artículo Científico
→
Artículo
→
View Item

dc.contributor.author	Mamani Coaquira, Yonatan
dc.contributor.author	Chumpisuca Carrion, Edith
dc.date.accessioned	2021-05-24T00:45:14Z
dc.date.available	2021-05-24T00:45:14Z
dc.date.issued	2020-03-20
dc.identifier.citation	IEEE	es_PE
dc.identifier.issn	2709-8990
dc.identifier.uri	http://repositorio.unamba.edu.pe/handle/UNAMBA/952
dc.description.abstract	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.	es_PE
dc.format	application/pdf	es_PE
dc.language.iso	spa	es_PE
dc.publisher	Universidad Nacional Micaela Bastidas de Apurímac	es_PE
dc.relation	info:pe-repo/semantics/software	es_PE
dc.relation.ispartofseries	Volumen 01;2020
dc.rights	info:eu-repo/semantics/openAccess	es_PE
dc.rights.uri	http://creativecommons.org/licenses/by-nc-sa/3.0/us/	*
dc.source	Universidad Nacional Micaela Bastidas de Apurímac	es_PE
dc.source	Repositorio Institucional - UNAMBA	es_PE
dc.subject	Apriori algorithm	es_PE
dc.subject	Frequent itemsets	es_PE
dc.subject	Parallel algorithm
dc.subject	Openmp
dc.title	Parallelization of the Apriori Algorithm for the Search of Frequent Elements	es_PE
dc.type	info:eu-repo/semantics/article	es_PE
dc.subject.ocde	https://purl.org/pe-repo/ocde/ford#1.02.01	es_PE
dc.identifier.journal	Revista de Investigación Micaela	es_PE
dc.description.peer-review	Pares	es_PE