|
Introduction
Algorithms
Download
Documentation
License
03589
visitors since 2010-02
|
Download
--> contact me by e-mail to receive the current version <--
Release notes
- v 0.66 - 2010-08-25: added an implementation of AprioriTID and some code for generating association rules by using FP-GROWTH.
- v 0.65 - 2010-08-14: fixed a bug in the BIDE+ algorithm (thanks to Brock for reporting it)
- v 0.64 - 2010-07-19: minor changes (add comments, fixed minor bugs, etc.)
- v 0.63 - 2010-04: minor changes (add comments, fixed minor bugs, etc.)
- v.062 - 2010-04-11: fixed a bug in the triangular matrix used by the CHARM and ECLAT algorithms.
- v.061 - 2010-03-20: implementation of FP-GROWTH, fixed a bug in BIDE+ (thanks to G. Bruno for reporting it) and fixed a bug in RELIM
- v.060 - 2010-03-15: fixed a bug in CHARM/ECLAT occuring if items are missing in the input file (thanks to A. Pardeshi for reporting it)
- v.059 - 2010-02-05: fixed a bug in the BIDE+ implementation (thanks to G. Bruno for reporting it)
- v.0.58 - 2009-12-15: implementations of the CHARM, CHARM-MFI and ECLAT algorithms
- v.0.57 - 2009-11: implementation of the BIDE+ algorithm
- v.0.56 : 2009-10-09: implementations of the RELIM and PREFIXSPAN algorithms
- v.0.55 : 2009-08-01: cleaned the code and fixed some bugs
- ...
- v.050 - 2009-05-31 implementation of APRIORI-RARE and the APRIORI algorithm for mining association rules
- v.049 - 2008-12-07: initial release.
|