Node Connectivity

There are 3058 nodes that can be used as successor for a node with an output port of type Table.

MakeDensityBasedClusterer (3.7) 

Class for wrapping a Clusterer to make it return a distribution and density

OPTICS (3.7) 

Basic implementation of OPTICS clustering algorithm that should *not* be used as a reference for runtime benchmarks: more sophisticated implementations […]

SelfOrganizingMap (3.7) 

A Clusterer that implements Kohonen's Self Organizing Map algorithm for unsupervised clustering

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 […]