Struct DecisionTree

pub struct DecisionTree<L, F>
where
    F: TreeFunction,
{
    pub params: TreeParameters,
    /* private fields */
}

A decision tree for prediction all kinds of thing a decision tree can predict. A leaf of this tree contains data of type L. This tree uses a TreeFunction of Type F.

Fields

params: TreeParameters

Implementations

impl<L, F> DecisionTree<L, F>

where F: TreeFunction,

pub fn predict<'a>(&'a self, input: &F::Data) -> Option<&'a L>

Predict the output using the input. For doing that the input data will be tested using a binary feature of a node and depending on the result the feature of the left or right child node will be used for the next iteration. At the end there is a chosen leaf. Returns the data of the leaf the interior features have chosen. Returns None if the tree is invalid (e.g. no root-node).

Trait Implementations

impl<'de, L, F> Deserialize<'de> for DecisionTree<L, F>

where F: TreeFunction + DeserializeOwned, F::Param: DeserializeOwned, L: DeserializeOwned,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<L, F> Serialize for DecisionTree<L, F>

where F: TreeFunction + Serialize, F::Param: Serialize, L: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.