Node Connectivity
There are 2880 nodes that can be used as successor
for a node with an output port of type 
Table.
SimpleKMeans (3.7)
Cluster data using the k means algorithm
XMeans (3.7)
Cluster data using the X-means algorithm. X-Means is K-Means extended by an Improve-Structure part In this part of the algorithm the centers are attempted […]
sIB (3.7)
Cluster data using the sequential information bottleneck algorithm. Note: only hard clustering scheme is supported
Apriori (3.7)
Class implementing an Apriori-type algorithm
FPGrowth (3.7)
Class implementing the FP-growth algorithm for finding large item sets without candidate generation
FilteredAssociator (3.7)
Class for running an arbitrary associator on data that has been passed through an arbitrary filter
GeneralizedSequentialPatterns (3.7)
Class implementing a GSP algorithm for discovering sequential patterns in a sequential data set. The attribute identifying the distinct data sequences […]
HotSpot (3.7)
HotSpot learns a set of rules (displayed in a tree-like structure) that maximize/minimize a target variable/value of interest
PredictiveApriori (3.7)
Class implementing the predictive apriori algorithm to mine association rules. It searches with an increasing support threshold for the best 'n' rules […]
Tertius (3.7)
Finds rules according to confirmation measure (Tertius-type algorithm). For more information see: P