|32 bit||64 bit||(32/64 bit only for executable)|
|relim||(350 kb)||relim||(369 kb)||GNU/Linux executable|
|relim.exe||(250 kb)||relim.exe||(287 kb)||Windows console executable|
|relim.zip||(199 kb)||relim.tar.gz||(180 kb)||C sources, version 4.24 (2017.07.06)|
|census.zip||(382 kb)||census data set (UCI ML repository)|
|census||(2 kb)||shell script used for the conversion|
RElim is 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.
Note that the current version of this program can only find frequent item sets, not association rules.
Full description of the RElim program (included in the source package).
If you have trouble executing the program on Microsoft Windows, check whether you have the Microsoft Visual C++ Redistributable for Visual Studio 2017 (see under "Other Tools and Frameworks") installed, as the program was compiled with Microsoft Visual Studio 2017.
Papers that describe the algorithm/implementation:
An extension of the algorithm to mine fuzzy frequent item sets (which is available as part of the above 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.