Struct LGDTBuilder 

pub struct LGDTBuilder<D>
where
    D: OptimalDepth2Tree + ?Sized,
{ /* private fields */ }

Builder for LGDT. A depth-2 solver is required.

use dtrees_rs::algorithms::greedy::factories::with_error_minimizer;

let lgdt = with_error_minimizer().max_depth(5).min_support(5).build();
assert!(lgdt.is_ok());

Implementations

impl<D> LGDTBuilder<D>

where D: OptimalDepth2Tree + ?Sized,

pub fn with_default_info_gain_maximizer() -> LGDTBuilder<InfoGainMaximizer<NativeError>>

A builder whose lookahead maximises information gain.

pub fn with_default_error_minimizer() -> LGDTBuilder<ErrorMinimizer<NativeError>>

A builder whose lookahead minimises the error.

pub fn min_support(self, value: usize) -> Self

Minimum number of instances in each leaf.

pub fn max_depth(self, value: usize) -> Self

Maximum depth of the tree.

pub fn max_error(self, value: f64) -> Self

Only trees with a lower error are accepted.

pub fn max_time(self, value: f64) -> Self

Time limit in seconds.

pub fn search(self, value: Box<D>) -> Self

The depth-2 solver used for the lookahead.

pub fn build(self) -> Result<LGDT<D>, String>

Builds the learner, or says which required part is missing.

Trait Implementations

impl<D> Default for LGDTBuilder<D>

where D: OptimalDepth2Tree + ?Sized,

fn default() -> Self

Returns the “default value” for a type.