Find frequent item sets and association rules with the apriori algorithm.
Apriori is a program to find association rules and frequent item sets (also closed and maximal) 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. View larger image
Operating systems:
Windows 7, Windows Vista, Windows XP, Windows 2003, Windows Me, Windows 98, Windows 2000, Windows NT
Date:
05.04.2013
Похожие программы
