Node Connectivity
There are 2879 nodes that can be used as successor
for a node with an output port of type 
Table.
JRip (3.6) (legacy)
This class implements a propositional rule learner, Repeated Incremental Pruning to Produce Error Reduction (RIPPER), which was proposed by William W. Cohen […]
M5Rules (3.6) (legacy)
Generates a decision list for regression problems using separate-and-conquer. In each iteration it builds a model tree using M5 and makes the "best" leaf […]
NNge (3.6) (legacy)
Nearest-neighbor-like algorithm using non-nested generalized exemplars (which are hyperrectangles that can be viewed as if-then rules). For more […]
OneR (3.6) (legacy)
Class for building and using a 1R classifier; in other words, uses the minimum-error attribute for prediction, discretizing numeric attributes. For more […]
PART (3.6) (legacy)
Class for generating a PART decision list. Uses separate-and-conquer. Builds a partial C4.5 decision tree in each iteration and makes the "best" leaf into a […]
Prism (3.6) (legacy)
Class for building and using a PRISM rule set for classification. Can only deal with nominal attributes. Can't deal with missing values. Doesn't do any […]
Ridor (3.6) (legacy)
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.6) (legacy)
Class for building and using a 0-R classifier. Predicts the mean (for a numeric class) or the mode (for a nominal class).
CLOPE (3.6) (legacy)
Yiling Yang, Xudong Guan, Jinyuan You: CLOPE: a fast and effective clustering algorithm for transactional data. In: Proceedings of the eighth ACM SIGKDD […]
Cobweb (3.6) (legacy)
Class implementing the Cobweb and Classit clustering algorithms. Note: the application of node operators (merging, splitting etc.) in terms of ordering and […]