PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children–Parent Equivalence pruning

作者：

Highlights：

• In this paper, we propose a algorithm named PrePost+ for frequent itemset mining.

• PrePost+ employs N-lists to represent itemsets and Children–Parent Equivalence pruning to narrow search space.

• Experiment results on real datasets show that PrePost+ is effective and outperforms state-of-the-art algorithms.

摘要

•In this paper, we propose a algorithm named PrePost+ for frequent itemset mining.•PrePost+ employs N-lists to represent itemsets and Children–Parent Equivalence pruning to narrow search space.•Experiment results on real datasets show that PrePost+ is effective and outperforms state-of-the-art algorithms.

论文关键词：Data mining,Frequent itemset mining,N-lists,Pruning,Algorithm

论文评审过程：Available online 20 March 2015.

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