A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.

My_eclat
........\eclat
........\.....\doc
........\.....\...\copying
........\.....\...\readme
........\.....\ex
........\.....\..\flg2set
........\.....\..\hdr2set
........\.....\..\readme
........\.....\..\row2set
........\.....\..\tab2set
........\.....\..\test1.tab
........\.....\..\test2.tab
........\.....\..\test3.tab
........\.....\..\test4.tab
........\.....\..\test5.tab
........\.....\..\tid2set
........\.....\src
........\.....\...\bitmat.c
........\.....\...\bitmat.h
........\.....\...\eclat.c
........\.....\...\eclat.dsp
........\.....\...\eclat.dsw
........\.....\...\eclat.mak
........\.....\...\makefile

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．