Carpenter 1.44

Carpenter 1.44 provides you with a feature-rich and advanced application specially designed to help you find closed frequent item sets with the carpenter algorithm, which enumerates transaction sets, in contrast to many other frequent item set mining algorithms, which enumerate item sets. 

Such an approach can be highly competitive in special cases, namely if there are few transactions and (very) many items, which is a common situation in biological data sets, like gene expression data. For other data sets, however, it is not a recommendable approach.

A program to find closed frequent item sets with the carpenter algorithm (Pan et al. 2003), which enumerates transaction sets, in contrast to many other frequent item set mining algorithms, which enumerate item sets. Such an approach can be highly competitive in special cases, namely if there are few transactions and (very) many items, which is a common situation in biological data sets, like gene expression data. For other data sets, however, it is not a recommendable approach.

This implementation offers a variant based on transaction identifier lists according to the description in (Pan et al. 2003), although with several optimizations due to which it significantly outperforms the implementation of the Gemini package, which is provided by the authors of (Pan et al. 2003).

The default algorithm, however, is a variant based on an item occurrence counter table, which bears some vague resemblance to the horizontal approach in the RERII algorithm (Cong et al. 2004). This algorithm is the default, because it usually outperforms the variant based on transaction identifier lists.