A program to find frequent itemsets (also closed and maximal) with the eclat algorithm (Zaki et al. 1997), which carries out a depth first search on the subset lattice and determines the support of itemsets by intersecting transaction lists. The current version of this program can only find frequent itemsets, not association rules. It does not support the item clustering described by (Zaki et al. 1997). The census data set may be used to test this program.

Attention: In order to compile this program the apriori package must also be retrieved.

A paper that describes some implementation aspects of this program:

Efficient Implementations of Apriori and Eclat
Christian Borgelt.
Workshop of Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL, USA).
fimi_03.pdf (304 kb) fimi_03.ps.gz (197 kb) (9 pages)