Introduction - If you have any usage issues, please Google them yourself
A program to find frequent itemsets (also c losed and maximal) with the eclat algorithm, which carries out a depth first search on the sub set lattice and determines the support of items ets by intersecting transaction lists.
Packet : 99273910eclat.zip filelist
eclat/doc/
eclat/doc/copying
eclat/doc/readme
eclat/ex/
eclat/ex/flg2set
eclat/ex/hdr2set
eclat/ex/readme
eclat/ex/row2set
eclat/ex/tab2set
eclat/ex/test1.tab
eclat/ex/test2.tab
eclat/ex/test3.tab
eclat/ex/test4.tab
eclat/ex/test5.tab
eclat/ex/tid2set
eclat/src/
eclat/src/bitmat.c
eclat/src/bitmat.h
eclat/src/eclat.c
eclat/src/eclat.dsp
eclat/src/eclat.dsw
eclat/src/eclat.mak
eclat/src/makefile