Struct KFold 

pub struct KFold {
    pub k: usize,
    pub shuffle: Option<u64>,
}

The plain cut: the samples in k parts, each one held out while the rest train.

LeaveOneOut is this with k = n, and a holdout of one part in k is its fold 0. Neither earns a scheme of its own — a scheme that is a parameter is a name you have to remember for nothing.

use somatize_study::{KFold, Samples};

let folds = KFold { k: 5, shuffle: Some(0) }.folds(&Samples::of(100))?;
assert_eq!(folds.len(), 5);

Fields

k: usize

How many folds.

shuffle: Option<u64>

The seed, or None for the order they came in.

The seed both switches shuffling on and makes it repeatable, so “shuffled but not reproducible” is a state that cannot be written down.

Implementations

impl KFold

pub fn folds(&self, samples: &Samples) -> Result<Vec<Fold>, PartitionError>

The folds, in order. It uses neither the classes nor the groups.

Trait Implementations

impl Clone for KFold

fn clone(&self) -> KFold

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for KFold

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for KFold

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl From<KFold> for Partition

fn from(cut: KFold) -> Self

Converts to this type from the input type.

impl Hash for KFold

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for KFold

fn eq(&self, other: &KFold) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for KFold

impl StructuralPartialEq for KFold