| relim | Linux executable | (94 kb) | ||
| relim.exe | Windows console executable | (119 kb) | ||
| relim.zip | C sources, version 3.13, 2010.07.30 | (126 kb) | ||
| relim.tar.gz | (110 kb) | |||
| census.zip | census data set (from the UCI ML repository) | (390 kb) | ||
| census | shell script used for the conversion | (1 kb) |
A program to find frequent item sets (also closed and maximal) 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 is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets), but the simplicity of its structure. Basically all the work is done in one recursive function of fairly few lines of code.
A paper that describes the algorithm underlying this program (that is, the program relim, see above):
An extension of the algorithm to mine fuzzy frequent item sets (which is available as part of this program, but was originally implemented as a separate program relx) has been developed in:
More information about frequent item set mining, implementations of other algorithms as well as test data sets can be found at the Frequent Itemset Mining Implementations Repository.