Software Listing of Author : "Borgelt.net"
- Apriori for Windows
- License: Shareware
- Price:


A program to find association rules and frequent item sets (also closed and maximal as well as generators) with the Apriori algorithm (Agrawal et al. 1993), which carries out a breadth first search on the subset lattice and determines the support of item sets by subset tests. This is a pretty fast implementation that uses a prefix tree to organize the counters for the item sets. However, Apriori is outperformed on basically all data sets by depth-first algorithms like Eclat or FP-growth.
- Publisher: borgelt.net
- Date Released:
- Download Size: 143 KB
- Download
- Platform: WinOther
- FPgrowth for Windows
- License: Freeware
- Price: 0.00


A program to find frequent item sets (also closed and maximal as well as generators) with the FP-growth algorithm (frequent pattern growth, Han et al 2000), which represents the transaction database as a prefix tree which is enhanced with links that organize the nodes into lists referring to the same item. The search is carried out by projecting the prefix tree, working recursively on the result, and pruning the original tree.
- Publisher: borgelt.net
- Date Released:
- Download Size: 194 KB
- Download
- Platform: WinOther
- RElim for Windows
- License: Freeware
- Price: 0.00


A program to find frequent item sets (also closed and maximal) with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets), but the simplicity of its structure. Basically all the work is done in one recursive function of fairly few lines of code.
- Publisher: borgelt.net
- Date Released:
- Download Size: 194 KB
- Download
- Platform: WinOther
- Sequoia for Windows
- License: Shareware
- Price:


A program to find frequent sequences with unique occurrences of items and weight averaging. That is, an item may occur only once in each transaction (and thus also in each found frequent subsequence). The subsequences may contain gaps, that is, there may be additional items in the transactions interspersed with the items of the found subsequences. In addition, each item may be associated with a weight in a transaction. In this case, an average weight of each item in a subsequence is computed as the average over the occurrences of the subsequence.
- Publisher: borgelt.net
- Date Released:
- Download Size: 112 KB
- Download
- Platform: WinOther
- Seqwog for Windows
- License: Freeware
- Price: 0.00


A program to find frequent sequences without gaps in their occurrences. That is, the items of the frequent subsequences must always be consecutive in the underlying transactions. There must not be other items interspersed between the subsequence items. Subsequences may contain the same item multiple times.
- Publisher: borgelt.net
- Date Released:
- Download Size: 112 KB
- Download
- Platform: WinOther
