Table — NodePit

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

Nearest-neighbor-like algorithm using non-nested generalized exemplars (which are hyperrectangles that can be viewed as if-then rules).

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

Class for generating a PART decision list.

Class for building and using a PRISM rule set for classification.

The implementation of a RIpple-DOwn Rule learner.

Class for building and using a 0-R classifier.

Martin Ester, Hans-Peter Kriegel, Joerg Sander, Xiaowei Xu: A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.

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

Simple EM (expectation maximisation) class.

Cluster data using the FarthestFirst algorithm.

Node Connectivity