Help you find frequent item sets
The current version of this program can only find frequent item sets, not association rules. It does not support the item clustering described by (Zaki et al. 1997), but it does support diffsets (Zaki and Gouda 2003).
Eclat x64 is a small, simple application specially designed to help you find frequent item sets (also closed and maximal) with the eclat algorithm, which carries out a depth first search on the subset lattice and determines the support of item sets by intersecting transaction lists.