%X Frequent itemset mining is a data mining technique to discover the frequent patterns from a collection of databases. However, it becomes a computational expensive task when it is used for mining large volume of data. Hence, there is a necessity for a scalable algorithm that can handle bigger datasets. Binary-based Technique Algorithm (BBT) can simplify the process of generating frequent patterns by using bit wise operations and binary database representation. However, it still suffers with the problem of low performance when dealing with high volume of data and a minimum values of support threshold to generate the list of frequent itemset patterns. This is due to its design which run in a single thread of execution. This research proposed a Parallel Binary-Based Algorithm (P-BBA) to solve the mentioned problem. The proposed algorithm is designed with collaborative threads which simultaneously work together to generate frequent itemsets in a big data environment. A master/slave architecture is used to fit the algorithm with distributed computing platform. The obtained results showed significant reductions in execution time when using the proposed parallel binary-based algorithm. © 2021 Little Lion Scientific
%D 2021
%N 14
%O cited By 1
%L scholars14666
%J Journal of Theoretical and Applied Information Technology
%T P-BBA: A master/slave parallel binary-based algorithm for mining frequent itemsets in big data
%A A.N. Amir
%A H.S.A. Alhussian
%A S.O. Fageeri
%A R. Ahmad
%I Little Lion Scientific
%V 99
%P 3517-3526