A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm i

A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm i

一种频繁项集生成算法、能挖掘频繁闭项集、最大频繁项集-A frequent itemset algorithms for mining frequent closed itemsets, maximal frequent itemsets.