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.