A Novel Parallel Algorithm for Frequent Itemsets Mining in Large Transactional Databases

  • Huan Phan
  • Bac Le
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10933)


Since the era of data explosion, data mining in large transactional databases has become more and more important. There are many data mining techniques like association rule mining, the most important and well-researched one. Furthermore, frequent itemset mining is one of the fundamental but time-consuming steps in association rule mining. Most of the algorithms used in literature find frequent itemsets on search space items having at least a minsup and are not reused for subsequent mining. Therefore, in order to decrease the execution time, some parallel algorithms have been proposed for mining frequent itemsets. Nonetheless, these algorithms merely implement the parallelization of Apriori and FP-Growth algorithms. To deal with this problem, several parallel NPA-FI algorithms are proposed as a new approach in order to quickly detect frequent itemsets from large transactional databases using an array of co-occurrences and occurrences of kernel item in at least one transaction. Parallel NPA-FI algorithms are easily used in many distributed file system, namely Hadoop and Spark. Finally, the experimental results show that the proposed algorithms perform better than other existing algorithms.


Association rules Co-occurrence items Frequent itemsets Parallel algorithm 



This work was supported by University of Social Sciences and Humanities; University of Science, VNU-HCM, Vietnam.


  1. 1.
    Agrawal, R., Shafer, J.: Parallel mining of association rules. IEEE Trans. Knowl. Data Eng. 8, 962–969 (1996)CrossRefGoogle Scholar
  2. 2.
    Dong, J., Han, M.: BitTableFI: an efficient mining frequent itemsets algorithm. Knowl. Based Syst. 20(4), 329–335 (2007)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Song, W., Yang, B.: Index-BitTableFI: an improved algorithm for mining frequent itemsets. Knowl. Based Syst. 21, 507–513 (2008)CrossRefGoogle Scholar
  4. 4.
    Fournier‐Viger, P., Lin, J.C.-W., Vo, B., Chi, T.T., Zhang, J., Le, H.B.: A survey of itemset mining. WIREs Data Min. Knowl. Discov. 7(4), e1207 (2017). Scholar
  5. 5.
    Agrawal, R., Imilienski, T., Swami, A.: Mining association rules between sets of large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC, pp. 207–216 (1993)Google Scholar
  6. 6.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM-SIGMOD International Conference Management of Data (SIGMOD 2000), Dallas, TX, pp. 1–12 (2000)CrossRefGoogle Scholar
  7. 7.
    Lin, M.Y., Lee, P.Y., Hsueh, S.C.: Apriori-based frequent itemset mining algorithms on MapReduce. In: Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication, New York, NY, USA, p. 76 (2012)Google Scholar
  8. 8.
    Moonesinghe, H.D.K., Chung, M.J., Tan, P.N.: Fast parallel mining of frequent itemsets. Technical report no. 2, Department of Computer Science and Engineering, Michigan State University (2006)Google Scholar
  9. 9.
    Deng, Z.H., Wang, Z.H., Jiang, J.J.: A new algorithm for fast mining frequent itemsets using N-lists. Sci. China Inf. Sci. 55(9), 2008–2030 (2012)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Djenouri, Y., Bendjoudi, A., Djenouri, D., Habbas, Z.: Parallel BSO algorithm for association rules mining using master/worker paradigm. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds.) PPAM 2015. LNCS, vol. 9573, pp. 258–268. Springer, Cham (2016). Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Division of ITUniversity of Social Sciences and Humanities, VNU-HCMHo Chi Minh CityVietnam
  2. 2.Faculty of Mathematics and Computer ScienceUniversity of Science, VNU-HCMHo Chi Minh CityVietnam
  3. 3.Faculty of ITUniversity of Science, VNU-HCMHo Chi Minh CityVietnam

Personalised recommendations