[1] C.Targa, A.Prado, and A.Plastino. Improving direct counting for frequent set mining. Technical report, Instituto de Computa¸c˜ao, UFF RT-02/09 2003. [2] Claudio Lucchese, Salvatore Orlando, Paolo Palmerini, Raffaele Perego, and Fabrizio Silvestri. kdci: a multistrategy algorithm for mining frequent sets. In Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, November 2003. [3] S. Orlando, P. Palmerini, R. Perego, and F. Silvestri. Adaptive and resource-aware mining of frequent sets. In Proc. The 2002 IEEE International Conference on Data Mining (ICDM02), page 338345, 2002.
The experiments show that the improvement given by this optimization is sensible in some cases. The time needed for the third iteration is halved. Note that
2 4 6 iteration 8 10 12 14 Figure 1. The dataset used was T10I4D100K with a minimum absolute support of 10.