CFP last date
20 March 2024
Reseach Article

Eclat with Large Data base Parallel Algorithm and Improve its Efficiency

by Rana Ishita, Amit Rathod
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 143 - Number 13
Year of Publication: 2016
Authors: Rana Ishita, Amit Rathod
10.5120/ijca2016910462

Rana Ishita, Amit Rathod . Eclat with Large Data base Parallel Algorithm and Improve its Efficiency. International Journal of Computer Applications. 143, 13 ( Jun 2016), 33-37. DOI=10.5120/ijca2016910462

@article{ 10.5120/ijca2016910462,
author = { Rana Ishita, Amit Rathod },
title = { Eclat with Large Data base Parallel Algorithm and Improve its Efficiency },
journal = { International Journal of Computer Applications },
issue_date = { Jun 2016 },
volume = { 143 },
number = { 13 },
month = { Jun },
year = { 2016 },
issn = { 0975-8887 },
pages = { 33-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume143/number13/25139-2016910462/ },
doi = { 10.5120/ijca2016910462 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:46:19.994736+05:30
%A Rana Ishita
%A Amit Rathod
%T Eclat with Large Data base Parallel Algorithm and Improve its Efficiency
%J International Journal of Computer Applications
%@ 0975-8887
%V 143
%N 13
%P 33-37
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Data mining is the finding the hidden pattern from the huge amount of data. In Data mining, the definition of association rule finds interesting association or correlation relationships among a large set of data items. Association rule mining finding frequent pattern, correlations among the items or object in transactional database or relational database. Basic idea is that the search tree could be divided into sub process of equivalence classes. And since generating item sets in sub process of equivalence classes is independent from each other, we could do frequent item set mining in sub trees of equivalence classes in parallel. So the straightforward approach to parallelize Eclat is to consider each equivalence class as a data. We can distribute data to different nodes and nodes could work on data without any synchronization. Even though the sorting helps to produce different sets in smaller sizes, there is a cost for sorting. Our Research to analysis is that the size of equivalence class is relatively small and this size also reduces quickly as the search goes deeper in the recursion process. Base on time using more than using data we can handle large amount of data so first we develop Eclat algorithm then develop parallel Eclat algorithm then compare with using same data with respect time with the help of support and confidence.

References
  1. Shamila Nasreen, Muhammad Awais Azamb, Khurram Shehzad, Usman Naeem, Mustansar Ali Ghazanfar “Frequent Pattern mining algorithm finding associated frequent patterns for Data Streams: A Survey” 2014, Science Direct
  2. Xiaofeng Zheng a, Shu Wang a* “Study on the Method of Road Transport Management Information Data mining Based on Pruning Eclat Algorithm and Map Reduce “2014, Science Direct
  3. Zhigang Zhang, Genlin Ji*, Mengmeng Tang “MREclat: an Algorithm for Parallel Mining Frequent Item sets” 2013, IEEE
  4. Marghny H. Mohamed • Mohammed M. Darwieesh “Efficient mining frequent item sets algorithm” 2013, Springer
  5. Dr. S.Vijayarani, Ms. P. Sathya “An Efficient Algorithm for Mining Frequent Item Sets in Data Streams” 2013, International Journal of Innovative Research in Computer and Communication Engineering
  6. Kan Jin “A new Algorithm for Discovering Association Rules” 2010, IEEE
  7. Mingjun Song, and Sanguthevar Rajasekaran “A Transaction Mapping Algorithm for Frequent Item Sets Mining” Member, IEEE
  8. R. Agrawal, T. Imielinski, and A.N. Swami, "Mining association rules between sets of items in large databases," in ACM SIGMOD International Conference on Management of Data, Washington, 1993.
  9. R. Agrawal, and R. Srikant,"Fast algorithms for mining association rules," in 20th International Conference on Very Large Data Bases, Washington, 1994.
  10. J. Han, J. Pei, and Y. Yin, "Mining frequent patterns without candidate generation," in ACM SIGMOD International Conference on Management of Data, Texas, 2000.
  11. M.J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, "New algorithms for fast discovery of association rules," in Third International Conference on Knowledge Discovery and Data Mining, 1997.
  12. Avani M. Sakhapara, Bharathi H. N. “Comparative Study of Apriori Algorithms for Parallel Mining of Frequent Itemsets,” International Journal of Computer Applications, 2014.
  13. Tipawan Silwattananusarn1 and Assoc.Prof. Dr. KulthidaTuamsuk2 “Data Mining and Its Applications for Knowledge Management : A Literature Review from 2007 to 2012”, International Journal of Data Mining & Knowledge Management Process (IJDKP) Vol.2, No.5, September 2012.
  14. Han, J., Kamber, M.: “Data Mining Concepts and Techniques”, Morgan Kaufmann Publishers, 2006.
  15. Wan Aezwani Bt Wan Abu Bakar, Zailani B Abdullah, Md. Yazid B. Md Saman, Masita@Masila Bt abd Jalil, Mustafa B. Man “Vertical Association Rule Mining :Case Study Impkementation with Relational DBMS. “ ISTMET 2015.
  16. http://www.google.com
  17. http://www.wikipedia.com
Index Terms

Computer Science
Information Sciences

Keywords

Association rule Frequent Item Data Mining Eclat Algorithm Parallel Approach Parallel Eclat