Welcome to the InfoSci Platform
Reference Hub2
Near Candidate-Less Apriori With Tidlists and Other Apriori Implementations

Near Candidate-Less Apriori With Tidlists and Other Apriori Implementations

Mehmet Bicer, Daniel Indictor, Ryan Yang, Xiaowen Zhang
Copyright: © 2022 |Volume: 12 |Issue: 1 |Pages: 22
ISSN: 1947-9573|EISSN: 1947-9581|EISBN13: 9781683181590|DOI: 10.4018/IJAL.286163
Cite Article Cite Article

MLA

Bicer, Mehmet, et al. "Near Candidate-Less Apriori With Tidlists and Other Apriori Implementations." IJAL vol.12, no.1 2022: pp.1-22. http://doi.org/10.4018/IJAL.286163

APA

Bicer, M., Indictor, D., Yang, R., & Zhang, X. (2022). Near Candidate-Less Apriori With Tidlists and Other Apriori Implementations. International Journal of Applied Logistics (IJAL), 12(1), 1-22. http://doi.org/10.4018/IJAL.286163

Chicago

Bicer, Mehmet, et al. "Near Candidate-Less Apriori With Tidlists and Other Apriori Implementations," International Journal of Applied Logistics (IJAL) 12, no.1: 1-22. http://doi.org/10.4018/IJAL.286163

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this study we implemented four different versions of Apriori, namely, basic and basic multi-threaded, bloom filter, trie, and count-min sketch, and proposed a new algorithm – NCLAT (Near Candidate-Less Apriori with Tidlists). We compared the runtimes and max memory usages of our implementations among each other as well as with the runtime of Borgelt’s Apriori implementation in some of the cases. NCLAT implementation is more efficient than the other Apriori implementations that we know of in terms of the number of times the database is scanned, and the number of candidates generated. Unlike the original Apriori algorithm which scans the database for every level and creates all of the candidates in advance for each level, NCLAT scans the database only once and creates candidate itemsets only for level one but not afterwards. Thus the number of candidates created is equal to the number of unique items in the database.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.