Sequoia

Version: 2.1
Platforms: Windows

Categories: Graphic Design Software
Developer: Christian Borgelt
Distribution Type: Freeware
File Size: 118 Kb

Sequoia is 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.

 Like it? Share with your friends!

Other Windows Software of Developer «Christian Borgelt»:

 RElimRElim is 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. Basically all the work is done in one recursive function of fairly few lines of code. Fe SODIMSODIM is a program to find fault-tolerant (or approximate or fuzzy) frequent item sets (also closed and maximal) with the SODIM algorithm. Seqwog Seqwog is a command prompt application specially designed to help you 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 ot AprioriApriori 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 subs EclatEclat is a simple application specially designed to help you find frequent item sets (also closed and maximal) with the eclat algorithm, which carries out a depth first search on the subset lattice and determines the support of item sets by intersecting tr
 IsTaIsTa 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 hi JIMJIM is a program to find Jaccard item sets with an extension of the Eclat algorithm. In analogy to frequent item set mining, where one tries to find item sets the support of which exceeds a user-specified threshold (minimum support) in a database of transa ARuleGUIARuleGUI is a graphical user interface for the apriori program. It contains a simple viewer to display the rules in a table and supports sorting them according to consequent, size, support, confidence, lift value, and additional evaluation. MoSSMoSS is a program to find frequent molecular substructures in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining. Apart from the default MoSS/MoFa algorithm, this program contains the gSpan algor FPgrowthFPgrowth is a program to find frequent item sets (also closed and maximal) with the fpgrowth algorithm (frequent pattern growth, Han et al 2000), which represents the transaction database as a prefix tree which is enhanced with pointers that organize the n

» show all

Similar Applications:

Supported Operating Systems:
Windows 2000 |  Windows 2003 |  Windows 7 |  Windows 98 |  Windows Me |  Windows NT |  Windows Vista |  Windows XP |

Name:

Comment:

Enter text from image below:

Windows Software - Free Windows Downloads, Apps, Games, Freeware, Skype, Media Player, Antivirus, Gimp, Live, Starter for Windows XP, Vista, 7, 8, 10