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.




File list:
apriori
......\doc
......\...\apriori.html
......\...\arem.gp
......\...\chi2.tex
......\...\copying
......\...\c_rev.gp
......\...\line.gif

......\...\uparrow.gif

......\ex
......\..\flg2set
......\..\hdr2set
......\..\readme
......\..\row2set
......\..\rulesort
......\..\tab2set
......\..\test.app
......\..\test.rul
......\..\test1.tab
......\..\test2.tab
......\..\test3.tab
......\..\test4.tab
......\..\test5.tab
......\..\tid2set
......\..\xhdr2set
......\src
......\...\apriori.c
......\...\apriori.dsp
......\...\apriori.dsw
......\...\apriori.mak
......\...\istree.c
......\...\istree.h
......\...\makefile
......\...\tract.c
......\...\tract.h
util
...\doc
...\...\copying
...\src
...\...\listops.c
...\...\listops.h
...\...\makefile
...\...\memsys.c
...\...\memsys.h
...\...\nstats.c
...\...\nstats.h
...\...\params.c
...\...\params.h
...\...\parse.c
...\...\parse.h
...\...\scan.c
...\...\scan.h
...\...\symtab.c
...\...\symtab.h
...\...\tfscan.c
...\...\tfscan.h
...\...\util.mak
...\...\vecops.c
...\...\vecops.h