Reducing the Main Memory Consumptions of FPmax* and FPclose.

Jianfei Zhu, Gösta Grahne · 2004

In [4], we gave FPgrowth*, FPmax* and FPclose for mining all, maximal and closed frequent itemsets, respectively. In this short paper, we describe two approaches for improving the main memory consumptions of FPmax* and FPclose. Experimental results show that the two approaches successfully reduce the main memory requirements of the two algorithms, and that in particular one of the approaches does not incur any practically significant extra running time.

Read the paper · More papers on PaperTik