| eclat | Linux executable | (58 kb) | ||
| eclat.exe | Windows console executable | (108 kb) | ||
| eclat.zip | C sources, version 3.1, 2008.11.13 | (110 kb) | ||
| eclat.tar.gz | (96 kb) | |||
| census.zip | census data set (from the UCI ML repository) | (390 kb) | ||
| census | shell script used for the conversion | (1 kb) |
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.
A paper that describes some implementation aspects of an earlier version of this program (note that due to a complete redesign in version 3.0, this description does not fit the program anymore):
More information about frequent item set mining, implementations of other algorithms as well as test data sets can be found at the Frequent Itemset Mining Implementations Repository.
Last updated: Fri Nov 14 22:32:58 CET 2008 - christian@borgelt.net
