Struct Stratified 

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

Stratifying is not a different algorithm: it is a KFold applied inside each class, the folds concatenated. That is why there is one scheme here and not sklearn’s KFold / StratifiedKFold pair.

Needs by_class.

Fields

k: usize

How many folds.

shuffle: Option<u64>

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

Implementations

impl Stratified

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

The folds, in order.

A class with fewer members than folds cannot be in all of them, and that is an error: sklearn warns and carries on, which leaves a result you cannot tell from a good one.

Trait Implementations

impl Clone for Stratified

fn clone(&self) -> Stratified

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Stratified

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

Formats the value using the given formatter.

impl Display for Stratified

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

Formats the value using the given formatter.

impl From<Stratified> for Partition

fn from(cut: Stratified) -> Self

Converts to this type from the input type.

impl Hash for Stratified

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 Stratified

fn eq(&self, other: &Stratified) -> 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 Stratified

impl StructuralPartialEq for Stratified