doi: 10.4304/jsw.6.2.306-313
A DIC-based Distributed Algorithm for Frequent Itemset Generation
- 1 Department of Computer Applications, Shri Ramdeobaba Kamla Nehru Engineering College, Nagpur, Maharashtra, India
- 2 Department of Computer Science,Visvesvaraya National Institute of Technology (VNIT),Nagpur, Maharashtra, India
Abstract
A distributed algorithm based on Dynamic Itemset Counting (DIC) for generation of frequent itemsets is presented by us. DIC represents a paradigm shift from Apriori-based algorithms in the number of passes of the database hence reducing the total time taken to obtain the frequent itemsets. We exploit the advantage of Dynamic Itemset Counting in our algorithm- that of starting the counting of an itemset as early as possible at the different site as soon as they become frequent at atleast one site. Hence, our algorithm shows remarkable improvement in the amount of time taken because of reduction in the number of passes of the database and comparatively lesser number of candidates generated. Distributed frequent itemset counting and association rule generation have basically used algorithms based on <em>Apriori</em> or <em>Sampling</em>. This is the first algorithm which is based on DIC.
Keywords
- Distributed Association Rule Mining
- dyn
How to Cite
Preeti Paranjape-Voditel and Umesh Deshpande, "A DIC-based Distributed Algorithm for Frequent Itemset Generation," Journal of Software, vol. 6, no. 2, pp. 306-313, 2011. https://doi.org/ 10.4304/jsw.6.2.306-313
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).