Gets the current Model used for the Learner.
Gets the current Model used for the Learner.
the Model object used for training
Init the model based on the algorithm implemented in the learner.
Init the model based on the algorithm implemented in the learner.
the ExampleSpecification of the input stream.
Train the model based on the algorithm implemented in the learner, from the stream of Examples given for training.
Train the model based on the algorithm implemented in the learner, from the stream of Examples given for training.
a stream of Examples
The Hoeffding tree is an incremental decision tree learner for large data streams, that assumes that the data distribution is not changing over time. It grows incrementally a decision tree based on the theoretical guarantees of the Hoeffding bound (or additive Chernoff bound). A node is expanded as soon as there is sufficient statistical evidence that an optimal splitting feature exists, a decision based on the distribution-independent Hoeffding bound. The model learned by the Hoeffding tree is asymptotically nearly identical to the one built by a non-incremental learner, if the number of training instances is large enough.
It is controlled by the following options: