Mining erasable itemsets with subset and superset itemset constraints

作者：

Highlights：

• We state the problem of mining EIs with subset and superset itemset constraints.

• Two propositions supporting a quick pruning nodes were proposed.

• pMEIC algorithm based on two above propositions was proposed.

• The experiments were conducted to show the effectiveness of pMEIC.

摘要

•We state the problem of mining EIs with subset and superset itemset constraints.•Two propositions supporting a quick pruning nodes were proposed.•pMEIC algorithm based on two above propositions was proposed.•The experiments were conducted to show the effectiveness of pMEIC.

论文关键词：Data mining,Erasable itemset,Subset and superset itemset constraint,Pruning techniques

论文评审过程：Received 19 July 2016, Revised 12 October 2016, Accepted 13 October 2016, Available online 15 October 2016, Version of Record 24 October 2016.

论文官网地址：https://doi.org/10.1016/j.eswa.2016.10.028