An Incremental Closed Frequent Itemsets Mining Algorithm Based on Shadow Prefix Tree

This paper introduces an incremental closed frequent item sets mining algorithm, which is based on a shadow prefix tree to get closed frequent item sets. By the use of shadow technology this algorithm can avoid the cost of generating and testing of candidate subsets. Shadow prefix tree can find nodes by virtual node without generating all nodes. The experiment results show that this algorithm can deal with big data more efficiently than others.