Node Connectivity
There are 2897 nodes that can be used as successor
for a node with an output port of type 
Table.
Ridor (3.7)
An implementation of a RIpple-DOwn Rule learner. It generates a default rule first and then the exceptions for the default rule with the least (weighted) […]
ZeroR (3.7)
Class for building and using a 0-R classifier
CLOPE (3.7)
Yiling Yang, Xudong Guan, Jinyuan You: CLOPE: a fast and effective clustering algorithm for transactional data
CascadeSimpleKMeans (3.7)
Cascade simple k means, selects the best k according to calinski-harabasz criterion
Cobweb (3.7)
Class implementing the Cobweb and Classit clustering algorithms. Note: the application of node operators (merging, splitting etc.) in terms of ordering and […]
DBSCAN (3.7)
Basic implementation of DBSCAN clustering algorithm that should *not* be used as a reference for runtime benchmarks: more sophisticated implementations […]
EM (3.7)
Simple EM (expectation maximisation) class. EM assigns a probability distribution to each instance which indicates the probability of it belonging to each […]
FarthestFirst (3.7)
Cluster data using the FarthestFirst algorithm. For more information see: Hochbaum, Shmoys (1985)
FilteredClusterer (3.7)
Class for running an arbitrary clusterer on data that has been passed through an arbitrary filter
HierarchicalClusterer (3.7)
Hierarchical clustering class. Implements a number of classic agglomorative (i.e