Enhancing the apriori algorithm for frequent set counting

In this paper we propose DCP, a new algorithm for solv- ing the Frequent Set Counting problem, which enhances Apriori. Our goal was to optimize the initial iterations of Apriori, i.e. the most time consuming ones when datasets characterized by short or medium length frequent patterns are considered. The main improvements regard the use of an innovative method for storing candidate set of items and counting their support, and the exploitation of eective pruning techniques which signicantly reduce the size of the dataset as execution progresses.