Mining Erasable Itemsets from a Product Database with Quantitative Components

Erasable itemset mining is one of the most well-known methods in data mining for optimizing limited materials. After mining erasable itemsets, the manager can rearrange the production plan effectively. However, in real applications, traditional mining methods neglect some critical factors, such as costs or quantities of components forming a product. This thesis thus considers mining erasable itemsets from a product database with quantitative components. An erasable profit-based itemset mining (EPIM) algorithm is proposed to mine erasable itemsets with low profits by analyzing the relationships between products and components. In experiments, a synthetic dataset was used to compare the performance in execution speed and memory usage under various threshold settings. It can also be easily generalized to find erasable itemsets satisfying the other criteria with a quantitative product database.