Description: Apriori algorithm】 【l: 1994 by R. Agrawal et al to the Apriori algorithm is a classical association rule mining algorithm, and later many of the algorithms are based on the idea of the algorithm. The name comes from the algorithm applied in the algorithm a priori knowledge of frequent item sets, ie: any of a frequent itemset must be a non-empty subset of frequent item sets so long as a particular set of non-frequent, its superset to no longer need to test.
File list (Check if you may need any files):
apriori\src\makefile
.......\...\apriori.mak
.......\...\istree.c
.......\...\apriori.dsp
.......\...\Debug\vc60.idb
.......\...\.....\vc60.pdb
.......\...\apriori.ncb
.......\...\apriori.plg
.......\...\apriori.c
.......\...\istree.h
.......\...\apriori.opt
.......\...\apriori.dsw
.......\ex\hdr2set
.......\..\test1.tab
.......\..\xhdr2set
.......\..\row2set
.......\..\test2.tab
.......\..\test4.tab
.......\..\test.app
.......\..\tab2set
.......\..\rulesort
.......\..\test5.tab
.......\..\test.rul
.......\..\flg2set
.......\..\readme.txt
.......\..\tid2set
.......\..\test3.tab
.......\doc\chi2.aux
.......\...\c_rev.gp
.......\...\line.gif
.......\...\chi2.tex
.......\...\uparrow.gif
.......\...\chi2.pdf
.......\...\chi2.log
.......\...\apriori.html
.......\...\arem.gp
.......\...\copying
.......\src\Debug
.......\src
.......\ex
.......\doc
apriori
Download