Association Rules Mining in Cloud Computing Environments using Improved Apriori Algorithm
DOI:
https://doi.org/10.26438/ijcse/v6i12.399403Keywords:
Data mining, Cloud Computing Association rulesAbstract
This paper describes how data mining is used in cloud computing. Data Mining used for extracting potentially useful information from raw data. The integration of data mining techniques into normal day-to-day activities has become commonplace. Every day people confronted with targeted advertising, and data mining techniques help businesses to become more efficient by reducing costs. Cloud computing provides a powerful, scalable and flexible infrastructure into which one can integrate, previously known, techniques and methods of Data Mining. Data security and access control are the most challenging in cloud computing because users send their sensitive data to the cloud service providers. The service providers must have a suitable way to protect their client’s sensitive data. Association rules are dependency rules, which predict occurrence of an item based on occurrences of other items. Apriori is the best-known algorithm to mine association rules. In this paper, we use Modified Apriori algorithm to mine the data from the cloud using sector/sphere framework with association rules.
References
[1] Iyer Chandrasekharan P.K. Baruah “Privacy-Preserving Frequent Itemset Mining in Outsourced Transaction Databases” Sri Sathya Sai Institute of Higher Learning Prashanti Nilayam, A.P., India 2015 IEEE.
[2] Abdur Rahim Mohammad Forkan, Ibrahim Khalil “BDCaM: Big Data for Context-aware Monitoring - A Personalized Knowledge Discovery Framework for Assisted Healthcare” IEEE Transaction on cloud computing, vol. x, no. x, February 2015.
[3] Jinggui Liao, Yuelong Zhao, and Saiqin Long,―MRPrePostA Parallel algorithm adapted for mining big data,‖ IEEE Workshop on Electronics,Computer and Applications, 2014
[4] Aditi V. Jarsaniya, Shruti B. Yagnik. “A Literature Survey on Frequent Pattern Mining for Biological Sequence”. © 2014 IJIRT | Volume 1 Issue 6 | ISSN: 2349-6002
[5] Dr. Vijayalakshmi M N, S.Anupama Kumar, Kavyashree BN. 2014. ― Investigating Interesting Rules Using Association Mining for Educational Data‖, International Journal of Advanced Research in Computer Engineering & Technology (IJARCET) Volume 3, Issue 2, pp.268-271
[6] Lingjuan Li , Min Zhang , “The Strategy of Mining Association Rule Based on Cloud Computing”, 2011 IEEE.
[7] ]T.R. Gopalakrishnan Nair, K.Lakshmi Madhuri , “Data Mining Using Hierarchical Virtual KMeans Approach Integrating Data Fragments In Cloud Computing Environment”,2011 IEEE.
[8] L. J. Li and M. Zhang, “The strategy of mining association rule based on cloud computing,” in Proc. 2011 International Conference on Business Computing and Global Informatization.
[9] F. Marozzo, D. Talia, and P. Trunfio, “A cloud framework for parameter sweeping data mining applications,” in Proc. 2011 Third IEEE International Conference on Coud Computing Technology and Science.
[10] Jiabin Deng, JuanLi Hu, Anthony Chak Ming LIU, Juebo Wu, “Research and Application of Cloud Storage”,2010 IEEE.
[11] Yang Lai , Shi ZhongZhi ,” An Efficient Data Mining Framework on Hadoop using Java Persistence API” , 2010 10th IEEE International Conference on Computer and Information Technology (CIT 2010).
[12] K. W. Lin, Y.-C. Luo, 2009, “A Fast Parallel Algorithm for Discovering Frequent Patterns”, GRC `09. IEEE Int. Conf. on Granular Computing, pp. 398 – 403.
[13] J. Zhou and K.-M. Yu, 2008, “Tidset-based Parallel FP-tree Algorithm for the Frequent Pattern Mining Problem on PC Clusters”, Lecture Notes in Computer Science 5036, pp. 18- 28.
[14] J. Zhou and K.-M. Yu, 2008, “Balanced Tidset-based Parallel FP-tree Algorithm for the Frequent Pattern Mining on Grid System”, Fourth Int. Conf. on Semantics, Knowledge and Grid, pp. 103-108.
[15] A. Javed, and A. Khokhar, 2004, “Frequent Pattern Mining on Message Passing Multiprocessor Systems”, Distributed and Parallel Databases, vol. 16, pp. 321–334.
[16] G. Grahne and J. Zhu, 2003, “Efficiently Using Prefix-trees in Mining Frequent Itemsets”, In Proc. of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations.
[17] J. Han, J. Pei, and Y. Yin, 2000, “Mining Frequent Patterns without Candidate Generation”, In Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp.1-12
[18] R. J. Bayardo, Jr., Brute-force mining of high-confidence classification rules. In Proceedings of the 3rd international conference on knowledge discovery and data mining (KDD`97), Newport Beach, California, USA.
[19] M. Ester, H.-P. Kriegel, J. Sander, and X. Xu, 1996, “A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise”, In Proc. 2nd Int. Conf. on Knowledge Discovery and Data Mining, Portland, OR, AAAI Press, pp. 226-231.
[20] R. Agrawal, R. Srikant, Mining Sequential Patterns, in: Proc. of the 11th Int’l Conf. on Data Engineering, 1995, pp. 3-14.
[21] R. Agrawal and R. Srikant. Quest Synthetic Data Generator. IBM Almaden Research Center, San Jose, California, http://www.almaden.ibm.com/cs/quest/syndata.html.
[22] R. Agrawal, T. Imielinski*, and A. Swami, 1993, “Mining association rules between sets of items in large databases”, In Proc. of the 1993 ACM-SIGMOD Int. Conf. on management of data (SIGMOD’93), p
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.
