Incrementally building frequent closed itemset lattice

作者：

Highlights：

• We propose the full maintenance process for frequent closed itemset lattice.

• With the index table, the search speed can be improved by finding the itemset in the sub-lattice.

• The theorems about the maximum children of a new node will help to reduce the mining time.

• Experimental results show that the proposed algorithm is more efficient than CLICL algorithm.

摘要

•We propose the full maintenance process for frequent closed itemset lattice.•With the index table, the search speed can be improved by finding the itemset in the sub-lattice.•The theorems about the maximum children of a new node will help to reduce the mining time.•Experimental results show that the proposed algorithm is more efficient than CLICL algorithm.

论文关键词：Data mining,Incremental mining,Iceberg lattice,Frequent closed itemsets

论文评审过程：Available online 19 November 2013.

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