Package ca.pfv.spmf.algorithms.frequentpatterns.vme

Class Summary

Class

Description

AlgoVME

This is an implementation of the VME algorithm (Deng and Xu, 2011) for erasable itemset mining. The VME algorithm finds all the ereasable itemsets from a product database. Actually, this algorithms is a only slight modification of the AprioriTID algorithm. I have implemented mostly as described in the paper with some modifications to make it more efficient. First, the authors suggested to generate all candidates of a level before removing the unereasable ones.