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:null:20.500.14195/1371
Enlace del recurso:https://hdl.handle.net/20.500.14195/1371
Nivel de acceso:acceso abierto
Materia:Apriori algorithm
Frequent itemsets
Parallel algorithm
Openmp
https://purl.org/pe-repo/ocde/ford#1.02.01
id UNMB_316fa8fd86b37aa2d01ff47bcb9860b6
oai_identifier_str oai:null:20.500.14195/1371
network_acronym_str UNMB
network_name_str UNAMBA-Institucional
repository_id_str .
dc.title.none.fl_str_mv Parallelization of the Apriori Algorithm for the Search of Frequent Elements
title Parallelization of the Apriori Algorithm for the Search of Frequent Elements
spellingShingle Parallelization of the Apriori Algorithm for the Search of Frequent Elements
Mamani Coaquira, Yonatan
Apriori algorithm
Frequent itemsets
Parallel algorithm
Openmp
https://purl.org/pe-repo/ocde/ford#1.02.01
title_short Parallelization of the Apriori Algorithm for the Search of Frequent Elements
title_full Parallelization of the Apriori Algorithm for the Search of Frequent Elements
title_fullStr Parallelization of the Apriori Algorithm for the Search of Frequent Elements
title_full_unstemmed Parallelization of the Apriori Algorithm for the Search of Frequent Elements
title_sort Parallelization of the Apriori Algorithm for the Search of Frequent Elements
author Mamani Coaquira, Yonatan
author_facet Mamani Coaquira, Yonatan
Chumpisuca Carrion, Edith
author_role author
author2 Chumpisuca Carrion, Edith
author2_role author
dc.contributor.author.fl_str_mv Mamani Coaquira, Yonatan
Chumpisuca Carrion, Edith
dc.subject.none.fl_str_mv Apriori algorithm
Frequent itemsets
Parallel algorithm
Openmp
topic Apriori algorithm
Frequent itemsets
Parallel algorithm
Openmp
https://purl.org/pe-repo/ocde/ford#1.02.01
dc.subject.ocde.none.fl_str_mv https://purl.org/pe-repo/ocde/ford#1.02.01
description 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.
publishDate 2020
dc.date.accessioned.none.fl_str_mv 2025-11-07T16:59:54Z
dc.date.available.none.fl_str_mv 2025-11-07T16:59:54Z
dc.date.issued.fl_str_mv 2020-03-20
dc.type.none.fl_str_mv info:eu-repo/semantics/article
dc.type.version.none.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.citation.none.fl_str_mv IEEE
dc.identifier.isbn.none.fl_str_mv 2709-8990
dc.identifier.uri.none.fl_str_mv https://hdl.handle.net/20.500.14195/1371
identifier_str_mv IEEE
2709-8990
url https://hdl.handle.net/20.500.14195/1371
dc.language.iso.none.fl_str_mv spa
language spa
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
dc.rights.uri.none.fl_str_mv http://creativecommons.org/licenses/by-nc-nd/3.0/us/
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-nd/3.0/us/
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidad Nacional Micaela Bastidas de Apurímac
dc.publisher.country.none.fl_str_mv PE
publisher.none.fl_str_mv Universidad Nacional Micaela Bastidas de Apurímac
dc.source.none.fl_str_mv reponame:UNAMBA-Institucional
instname:Universidad Nacional Micaela Bastidas de Apurímac
instacron:UNAMBA
instname_str Universidad Nacional Micaela Bastidas de Apurímac
instacron_str UNAMBA
institution UNAMBA
reponame_str UNAMBA-Institucional
collection UNAMBA-Institucional
bitstream.url.fl_str_mv https://repositorio.unamba.edu.pe/bitstreams/277ee950-2b57-4bf9-85ad-674e47f5155b/download
https://repositorio.unamba.edu.pe/bitstreams/05d0992b-1078-4a7f-9501-66c618da4ea7/download
https://repositorio.unamba.edu.pe/bitstreams/dcf5cc2c-4d3c-45e9-84e3-c15c488b2151/download
https://repositorio.unamba.edu.pe/bitstreams/21b5af10-cfe9-48f8-850d-f494d5b883a6/download
bitstream.checksum.fl_str_mv baf242cd044a26217469b59f958827c1
bb9bdc0b3349e4284e09149f943790b4
d5db95cbda28091a95c340cdc1bbd35e
dd071033ea9dd4fe9c3f7bb228e67d21
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
MD5
MD5
repository.name.fl_str_mv Repositorio UNAMBA
repository.mail.fl_str_mv repositorio@unamba.edu.pe
_version_ 1868176830077337600
spelling Mamani Coaquira, YonatanChumpisuca Carrion, Edith2025-11-07T16:59:54Z2025-11-07T16:59:54Z2020-03-20IEEE2709-8990https://hdl.handle.net/20.500.14195/1371There 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.application/pdfspaUniversidad Nacional Micaela Bastidas de ApurímacPEinfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/3.0/us/Apriori algorithmFrequent itemsetsParallel algorithmOpenmphttps://purl.org/pe-repo/ocde/ford#1.02.01Parallelization of the Apriori Algorithm for the Search of Frequent Elementsinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionreponame:UNAMBA-Institucionalinstname:Universidad Nacional Micaela Bastidas de Apurímacinstacron:UNAMBAORIGINALA-Mamani-Coaquira-Yonatan.pdfA-Mamani-Coaquira-Yonatan.pdfapplication/pdf227224https://repositorio.unamba.edu.pe/bitstreams/277ee950-2b57-4bf9-85ad-674e47f5155b/downloadbaf242cd044a26217469b59f958827c1MD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81748https://repositorio.unamba.edu.pe/bitstreams/05d0992b-1078-4a7f-9501-66c618da4ea7/downloadbb9bdc0b3349e4284e09149f943790b4MD52TEXTA-Mamani-Coaquira-Yonatan.pdf.txtA-Mamani-Coaquira-Yonatan.pdf.txtExtracted texttext/plain19273https://repositorio.unamba.edu.pe/bitstreams/dcf5cc2c-4d3c-45e9-84e3-c15c488b2151/downloadd5db95cbda28091a95c340cdc1bbd35eMD53THUMBNAILA-Mamani-Coaquira-Yonatan.pdf.jpgA-Mamani-Coaquira-Yonatan.pdf.jpgGenerated Thumbnailimage/jpeg5417https://repositorio.unamba.edu.pe/bitstreams/21b5af10-cfe9-48f8-850d-f494d5b883a6/downloaddd071033ea9dd4fe9c3f7bb228e67d21MD5420.500.14195/1371oai:repositorio.unamba.edu.pe:20.500.14195/13712025-11-12 20:40:31.086http://creativecommons.org/licenses/by-nc-nd/3.0/us/info:eu-repo/semantics/openAccessopen.accesshttps://repositorio.unamba.edu.peRepositorio UNAMBArepositorio@unamba.edu.peTk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0IG93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLCB0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZyB0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sIGluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlIHN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yIHB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZSB0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQgdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uIGFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LCB5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZSBjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdCBzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkIHdpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRCBCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUgRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSCBDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZSBzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMgbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo=
score 13.407886
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