Trait TreeSearchAlgorithm 

pub trait TreeSearchAlgorithm {
    // Required methods
    fn fit(&mut self, cover: &mut Cover) -> Result<(), FitError>;
    fn tree(&self) -> &Tree;

    // Provided methods
    fn error(&self) -> f64 { ... }
    fn get_candidates(
        &self,
        cover: &mut Cover,
        min_sup: usize,
        provided_candidates: Option<&[usize]>,
        previous: Option<usize>,
    ) -> Vec<usize> { ... }
}

A tree learner.

Required Methods

fn fit(&mut self, cover: &mut Cover) -> Result<(), FitError>

Learns a tree on the instances of cover.

fn tree(&self) -> &Tree

The tree learned by the last fit.

Provided Methods

fn error(&self) -> f64

Training error of the learned tree.

fn get_candidates( &self, cover: &mut Cover, min_sup: usize, provided_candidates: Option<&[usize]>, previous: Option<usize>, ) -> Vec<usize>

Features that can split the current node. See find_valid_split_attributes.

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl<C, D, E, H> TreeSearchAlgorithm for DL85<C, D, E, H>

where C: Caching + ?Sized, D: OptimalDepth2Tree + ?Sized, E: ErrorWrapper + ?Sized, H: Heuristic + ?Sized,

impl<D> TreeSearchAlgorithm for LGDT<D>

where D: OptimalDepth2Tree + ?Sized,