Reduction of Erasable Itemset Mining to Frequent Itemset Mining

抄録

Frequent-itemset mining and erasable-itemset mining are two commonly seen and useful techniques in data mining. Although the two mining problems look contrary, they are actually close to each other. In this paper, we will show the erasable itemset mining problem can be reduced into the frequent-itemset mining problem and can be solved by the existing algorithms of finding frequent itemsets. By this way, the variants of erasable-itemset mining can be easily designed out based on the frequent itemset mining.