Advertisement

A Novel Algorithm for Frequent Itemsets Mining in Transactional Databases

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

Abstract

Since the era of data explosion, data mining in 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 mining next time. To deal with this problem, NOV-FI algorithms are proposed as a new approach in order to quickly detect frequent itemsets from transactional databases using an array of co-occurrences and occurrences of kernel item in at least one transaction. NOV-FI algorithms are easily expanded in distributed systems. Finally, the experimental results show that the proposed algorithms perform better than other existing algorithms.

Keywords

Association rules Co-occurrence items Frequent itemsets 

Notes

Acknowledgements

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

References

  1. 1.
    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
  2. 2.
    Zaki, M.J.: Scalable algorithms for association mining. IEEE Trans. Knowl. Data Eng. 12(3), 372–390 (2000)CrossRefGoogle Scholar
  3. 3.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of 2000 ACM-SIGMOD International Conference on Management of Data (SIGMOD 2000), Dallas, TX, pp. 1–12 (2000)Google Scholar
  4. 4.
    Dong, J., Han, M.: BitTableFI: an efficient mining frequent itemsets algorithm. Knowl.-Based Syst. 20(4), 329–335 (2007)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Song, W., Yang, B.: Index-BitTableFI: an improved algorithm for mining frequent itemsets. Knowl.-Based Syst. 21, 507–513 (2008)CrossRefGoogle Scholar
  6. 6.
    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
  7. 7.
    Philippe, F.V., Jerry, C.W.L., Bay, V., Tin, C.T., Ji, Z., Bac, L.: A survey of itemset mining. Wiley Interdiscip. Rev.: Data Min. Knowl. Discov. 7(4) (2017)Google Scholar

Copyright information

© Springer Nature Switzerland AG 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