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

@article{Deng2015PrePostAE,
  title={PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children-Parent Equivalence pruning},
  author={Zhi-Hong Deng and Sheng-Long Lv},
  journal={Expert Syst. Appl.},
  year={2015},
  volume={42},
  pages={5424-5432}
}
N-list is a novel data structure proposed in recent years. It has been proven to be very efficient for mining frequent itemsets. In this paper, we present PrePost + , a high-performance algorithm for mining frequent itemsets. It employs N-list to represent itemsets and directly discovers frequent itemsets using a set-enumeration search tree. Especially, it employs an efficient pruning strategy named Children–Parent Equivalence pruning to greatly reduce the search space. We have conducted… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

A survey of itemset mining

Wiley Interdiscip. Rev. Data Min. Knowl. Discov. • 2017

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Similar Papers

Loading similar papers…