All Classes and Interfaces

Class
Description
Base class for Trainer's that use an approximation of the CART algorithm to build a decision tree.
Deprecated.
Base class for decision tree nodes used at training time.
Contains parameters needed to determine whether a node is a leaf.
A tag interface for a Trainer so the random forests trainer can check if it's actually a tree.
A trainer which produces an Extremely Randomized Tree Ensemble.
An array container which maintains the array and the size.
LeafNode<T extends Output<T>>
An immutable leaf Node that can create a prediction.
Node<T extends Output<T>>
A node in a decision tree.
A trainer which produces a random forest.
SplitNode<T extends Output<T>>
An immutable Node with a split and two child nodes.
TreeModel<T extends Output<T>>
A Model wrapped around a decision tree root Node.