Subsume concept in erasable itemset mining

Abstract

In recent year, erasable itemset mining is an interesting problem in supply chain optimization problem. In the previous works, we presented dPidset structure, a very effective structure for mining erasable itemsets. The dPidset structure improves the preferment compared with the previous structures. However, the mining time is still large. Therefore, in this paper, we propose a new approach using the subsume concept for mining effectively erasable itemsets. The subsume concept helps early determine information of a large number of erasable itemsets without usual computational cost. The experiment was conducted to show the effectiveness of using subsume concept in the mining erasable itemsets process.