|32 bit||64 bit||(32/64 bit only for executable)|
|ista||(310 kb)||ista||(333 kb)||GNU/Linux executable|
|ista.exe||(181 kb)||ista.exe||(213 kb)||Windows console executable|
|ista.zip||(194 kb)||ista.tar.gz||(174 kb)||C sources, version 4.21 (2017.06.13)|
|census.zip||(382 kb)||census data set (UCI ML repository)|
|census||(2 kb)||shell script used for the conversion|
IsTa is 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 (fewer items, many transactions), however, it is not a recommendable approach.
By default the program finds closed item sets. It can also find maximal item sets, but the filtering of the closed item sets may not be very efficient.
Full description of the IsTa program (included in the source package).
If you have trouble executing the program on Microsoft Windows, check whether you have the Microsoft Visual C++ Redistributable for Visual Studio 2017 (see under "Other Tools and Frameworks") installed, as the program was compiled with Microsoft Visual Studio 2017.
The algorithm used in this program is described in the following paper:
A reference to a closely related approach, which uses a much simpler repository and thus is considerably slower:
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.