An Efficient Algorithm for Mining Erasable Itemsets Using the Difference of NC-Sets

This paper proposes an improved version of the MERIT algorithm, deMERIT+, for mining all "erasable item sets". We first establish an algorithm MERIT+, a revised version of MERIT, which is then used as the foundation for deMERIT+. The proposed algorithm uses: a weight index, a hash table and the "difference" of Node Code Sets (dNC-Sets) to improve the mining time. A theorem is derived first to show that dNC-Sets can be used for mining erasable item sets. The experimental results show that deMERIT+ is more effective than MERIT+ in terms of the runtime.