user- 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 ...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 itemsets by subset tests. This is a pretty fast implementation that uses a prefix tree to organize the counters for the item sets. The census data set may be used to test the program.
