Fast algorithms for mining maximal erasable patterns
作者：
Highlights：
• We propose the concept of maximal erasable itemset from product databases.
• We develop Proposition 1 to check whether an itemset is maximal or not.
• We propose an efficient algorithm for mining erasable itemsets.
• We develop Proposition 2 for early pruning nodes.
• We use Proposition 2 to develop an algorithm for efficient mining.
摘要
•We propose the concept of maximal erasable itemset from product databases.•We develop Proposition 1 to check whether an itemset is maximal or not.•We propose an efficient algorithm for mining erasable itemsets.•We develop Proposition 2 for early pruning nodes.•We use Proposition 2 to develop an algorithm for efficient mining.
论文关键词：Data mining,Erasable itemset,Maximal erasable itemset,Pruning strategy
论文评审过程：Received 15 May 2018, Revised 9 January 2019, Accepted 9 January 2019, Available online 10 January 2019, Version of Record 24 January 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.01.034
