Date Added: Jan 2012
The present a distributed algorithm based on Dynamic Itemset Counting (DIC) for generation of frequent itemsets. The nature of 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. The authors' distributed algorithm, called the OPTimistic Messaging DIC (OPT-DIC) gives much better results than Count Distribution (CD). They exploit the advantage of DIC - that of starting the counting of an itemset as early as possible.