Eclat is a 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. It supports diffsets and algorithm variants.
WHAT’S NEW IN VERSION 4.0