pub struct MLTrainer { /* private fields */ }Expand description
ML model trainer
Implementations§
Source§impl MLTrainer
impl MLTrainer
Sourcepub fn new(
n_estimators: usize,
max_depth: Option<usize>,
max_features: usize,
) -> Self
pub fn new( n_estimators: usize, max_depth: Option<usize>, max_features: usize, ) -> Self
Create a new ML trainer
§Arguments
n_estimators- Number of trees in Random Forestmax_depth- Maximum depth of each tree (None for unlimited)max_features- Maximum TF-IDF features
§Examples
use organizational_intelligence_plugin::ml_trainer::MLTrainer;
let trainer = MLTrainer::new(100, Some(20), 1500);Sourcepub fn load_dataset<P: AsRef<Path>>(path: P) -> Result<TrainingDataset>
pub fn load_dataset<P: AsRef<Path>>(path: P) -> Result<TrainingDataset>
Sourcepub fn train(&self, dataset: &TrainingDataset) -> Result<TrainedModel>
pub fn train(&self, dataset: &TrainingDataset) -> Result<TrainedModel>
Train ML classifier on training dataset
§Arguments
dataset- Training dataset with splits
§Returns
Ok(TrainedModel)with trained classifierErrif training fails
§Examples
use organizational_intelligence_plugin::ml_trainer::MLTrainer;
use std::path::PathBuf;
let trainer = MLTrainer::new(100, Some(20), 1500);
let dataset = MLTrainer::load_dataset("training-data.json")?;
let model = trainer.train(&dataset)?;Sourcepub fn evaluate(
model: &TrainedModel,
test_examples: &[TrainingExample],
) -> Result<f32>
pub fn evaluate( model: &TrainedModel, test_examples: &[TrainingExample], ) -> Result<f32>
Sourcepub fn save_model<P: AsRef<Path>>(model: &TrainedModel, path: P) -> Result<()>
pub fn save_model<P: AsRef<Path>>(model: &TrainedModel, path: P) -> Result<()>
Sourcepub fn load_model<P: AsRef<Path>>(path: P) -> Result<TrainedModel>
pub fn load_model<P: AsRef<Path>>(path: P) -> Result<TrainedModel>
Trait Implementations§
Auto Trait Implementations§
impl Freeze for MLTrainer
impl RefUnwindSafe for MLTrainer
impl Send for MLTrainer
impl Sync for MLTrainer
impl Unpin for MLTrainer
impl UnwindSafe for MLTrainer
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.