negFIN: An efficient algorithm for fast mining frequent itemsets
作者：
Highlights：
• A fast algorithm for frequent itemset mining is proposed.
• The experimental results on benchmark datasets indicate that this algorithm is effective.
• This algorithm is based on a new data structure to store information about itemsets.
• This data structure employs a novel encoding model for nodes in a prefix tree.
• This encoding model is based on the bitmap representation of sets.
摘要
•A fast algorithm for frequent itemset mining is proposed.•The experimental results on benchmark datasets indicate that this algorithm is effective.•This algorithm is based on a new data structure to store information about itemsets.•This data structure employs a novel encoding model for nodes in a prefix tree.•This encoding model is based on the bitmap representation of sets.
论文关键词：Prefix tree,Nodesets,Bitmap representation,Frequent itemsets
论文评审过程：Received 3 December 2017, Revised 19 March 2018, Accepted 22 March 2018, Available online 24 March 2018, Version of Record 24 April 2018.
论文官网地址：https://doi.org/10.1016/j.eswa.2018.03.041
