Node Connectivity

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

OLM (3.7) 

This class is an implementation of the Ordinal Learning Method (OLM). Further information regarding the algorithm and variants can be found in: Arie […]

OneR (3.7) 

Class for building and using a 1R classifier; in other words, uses the minimum-error attribute for prediction, discretizing numeric attributes

PART (3.7) 

Class for generating a PART decision list

Prism (3.7) 

Class for building and using a PRISM rule set for classification

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