A novel pruning algorithm for mining long and maximum length frequent itemsets
作者：
Highlights：
• We propose LengthSort, an efficient algorithm for mining maximum length itemsets.
• LengthSort prunes items and transactions prior to constructing the initial tree.
• LengthSort can be easily integrated with other tree-based algorithms.
• LengthSort can be used to mine frequent itemsets that are longer than a threshold.
摘要
•We propose LengthSort, an efficient algorithm for mining maximum length itemsets.•LengthSort prunes items and transactions prior to constructing the initial tree.•LengthSort can be easily integrated with other tree-based algorithms.•LengthSort can be used to mine frequent itemsets that are longer than a threshold.
论文关键词：Association rules mining,Maximum length frequent itemsets,Data mining,Long frequent itemsets
论文评审过程：Received 23 February 2019, Revised 13 September 2019, Accepted 4 October 2019, Available online 7 October 2019, Version of Record 14 October 2019.
论文官网地址：https://doi.org/10.1016/j.eswa.2019.113004
