IsTa - Closed Frequent Item Set Mining

Download

Description

A program to find closed frequent item sets by intersecting transactions (Intersecting Transactions), which is based on the insight that an item set is closed if it is the intersection of all transactions that contain it. 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.

The program can also find maximal item sets, but the filtering of the closed item sets is a quick hack and not particularly efficient.

The algorithm used in this program is described in the following paper:

• Finding Closed Frequent Item Sets by Intersecting Transactions
  Christian Borgelt, Xiaoyuan Yang, Ruben Nogales-Cadenas, Pedro Carmona-Saez, and Alberto Pascual-Montano.
  Proc. 14th Int. Conf. on Extending Database Technology (EDBT 2011, Uppsala, Sweden), 367-376.
  ACM Press, New York, NY, USA 2011
  edbt_11.pdf (448 kb) edbt_11.ps.gz (373 kb) (10 pages)

A reference to a closely related approach:

• Intersecting Data to Closed Sets with Constraints
  T. Mielikäinen
  Proc. Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL)
  CEUR Workshop Proceedings 90, Aachen, Germany 2003

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.