Apriori algorithm implementation. A program to find association rules and frequent item sets (also closed and maximal) with the apriori algorithm (Agrawal et al. 1993), which carries out a breadth first search on the subset lattice and determines the support of item sets by subset tests. This is a pretty fast implementation that uses a prefix tree to organize the counters for the item sets.

usage: apriori.exe [options] infile [outfile [appfile]]
find frequent item sets with the apriori algorithm

The license of this software is Freeware, you can free download and free use this calculator software.