Description: A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
File list (Check if you may need any files):
Download