An Effective and Optimized Approach to Association Rule Mining using GPGPU

Authors

  • Kamath M Computer Engineering, PES Modern College of Engineering, Pune, India
  • Katariya A Computer Engineering, PES Modern College of Engineering/ SavitriBai Phule Pune University, Pune, India
  • Bhokare G Computer Engineering, PES Modern College of Engineering/ SavitriBai Phule Pune University, Pune, India

Keywords:

Associative rule mining, heterogenous parallel programming, CUDA, frequent pattern mining

Abstract

Frequent Pattern Growth (FP-Growth) is a data mining technique, FP-growth algorithm introduced frequent pattern tree (FP-tree), stored as frequent item-sets in a compressed way. It overcomes drawback of candidate generation approach of multiple database scan but at the same time the transaction identifiers can be quite long taking substantial memory space and computation time. An optimised data structure viz. the Multi-Path Graph is used to improve the utilization and increase the efficiency of data mining techniques. Here we will be using graph as a data structure for storing frequent patterns in the memory. The graph structure will help to mine these frequent patterns without constructing FP-trees. However FP-Growth and MP-Graph fail to process extremely vast data-sets optimally. So we will be attempting to compare FP-Growth with MP-Graph as per its efficiency and memory utilization capability using parallelization techniques. We will try to achieve parallelization using CUDA, and bring forth a comparison of both the mining techniques.

References

. R Agrawal, T Imielinski and A Swami, “Mining association rules between sets of items in large databases” In the proceedings of the SIGMOD ’93 ACM SIGMOD international conference on Management of data Pages 207-216

. J Han, J Pei, Y Yin. and R Mao, “Mining Frequent Patterns without Candidate Generation” In the proceedings of SIGMOD ’00 of the 2000 ACM SIGMOD international conference on Management of Pages 1-12

. H Li, Y Wang, D Zhang. and M Zhang, “PFP: Parallel FP Growth for Query Recommendation” In the proceedings on the ACM conference on Recommender system, pp 107-114 ACM (2008)

. R.V. Mane, V.R. Ghorpade, "Use of Constraints in Pattern Mining: A Survey", International Journal of Computer Sciences and Engineering, Vol.4, Issue.11, pp.95-99, 2016.

. M. Dhivya, D. Ragupathi, V.R. Kumar, "Hadoop Mapreduce Outline in Big Figures Analytics", International Journal of Computer Sciences and Engineering, Vol.2, Issue.9, pp.100-104, 2014.

. V. Jain, "Frequent Navigation Pattern Mining from Web usage data", International Journal of Scientific Research in Computer Science and Engineering, Vol.1, Issue.1, pp.47-51, 2013.

. Nidhi Sethi and Pradeep Sharma, "Mining Frequent Pattern from Large Dynamic Database Using Compacting Data Sets", International Journal of Scientific Research in Computer Science and Engineering, Vol.1, Issue.3, pp.31-34, 2013.

. Marie Fernandes , "Data Mining: A Comparative Study of its Various Techniques and its Process", International Journal of Scientific Research in Computer Science and Engineering, Vol.5, Issue.1, pp.19-23, 2017.

. Jaswant Meena, Ashish Mandloi , "Classification of Data Mining Techniques for Weather Prediction", International Journal of Scientific Research in Computer Science and Engineering, Vol.4, Issue.1, pp.21-24, 2016.

. Deepti Sharma and Vijay B. Aggarwal, "Mapreduce- A Fabric Clustered Approach to Equilibrate the Load", International Journal of Computer Sciences and Engineering, Vol.4, Issue.3, pp.116-123, 2016.

Downloads

Published

2025-11-11

How to Cite

[1]
M. Kamath, A. Katariya, and G. Bhokare, “An Effective and Optimized Approach to Association Rule Mining using GPGPU”, Int. J. Comp. Sci. Eng., vol. 5, no. 6, pp. 269–272, Nov. 2025.

Issue

Section

Research Article