|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
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
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.