ISSP-tree: An improved fast algorithm for constructing a complete prefix tree using single database scan

作者：

Highlights：

• A fast complete FP-Tree construction algorithm using single database scan.

• The proposed algorithm is adaptive to incremental and interactive mining.

• Performance evaluation based on transaction modification and threshold update.

• Correctness, completeness and complexity analysis of the proposed approach.

• Comparison with existing approaches using synthetic and real-life datasets.

摘要

•A fast complete FP-Tree construction algorithm using single database scan.•The proposed algorithm is adaptive to incremental and interactive mining.•Performance evaluation based on transaction modification and threshold update.•Correctness, completeness and complexity analysis of the proposed approach.•Comparison with existing approaches using synthetic and real-life datasets.

论文关键词：Association rule,Frequent pattern,Incremental mining,Frequent itemset,SSP-tree,ISSP-tree,FP-tree,Rule mining,Data mining

论文评审过程：Received 7 January 2020, Revised 3 July 2021, Accepted 11 July 2021, Available online 24 July 2021, Version of Record 28 July 2021.

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