pub struct FittedLabelBinarizer { /* private fields */ }Expand description
A fitted label binarizer holding the discovered class set.
Created by calling Fit::fit on a LabelBinarizer.
Implementations§
Source§impl FittedLabelBinarizer
impl FittedLabelBinarizer
Sourcepub fn inverse_transform(
&self,
y: &Array2<f64>,
) -> Result<Array1<usize>, FerroError>
pub fn inverse_transform( &self, y: &Array2<f64>, ) -> Result<Array1<usize>, FerroError>
Map a binary indicator matrix back to integer class labels.
For each row the class with the largest value (argmax) is chosen.
§Errors
Returns FerroError::ShapeMismatch if the number of columns does
not match the expected output width (1 for binary, K for multiclass).
Trait Implementations§
Source§impl Clone for FittedLabelBinarizer
impl Clone for FittedLabelBinarizer
Source§fn clone(&self) -> FittedLabelBinarizer
fn clone(&self) -> FittedLabelBinarizer
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for FittedLabelBinarizer
impl Debug for FittedLabelBinarizer
Source§impl Transform<ArrayBase<OwnedRepr<usize>, Dim<[usize; 1]>>> for FittedLabelBinarizer
impl Transform<ArrayBase<OwnedRepr<usize>, Dim<[usize; 1]>>> for FittedLabelBinarizer
Source§fn transform(&self, y: &Array1<usize>) -> Result<Array2<f64>, FerroError>
fn transform(&self, y: &Array1<usize>) -> Result<Array2<f64>, FerroError>
Transform labels into a binary indicator matrix.
- For K = 2 classes the output shape is
(n, 1). - For K > 2 classes the output shape is
(n, K).
§Errors
Returns FerroError::InvalidParameter if any label in y was not
seen during fitting.
Source§type Error = FerroError
type Error = FerroError
The error type returned by
transform.Auto Trait Implementations§
impl Freeze for FittedLabelBinarizer
impl RefUnwindSafe for FittedLabelBinarizer
impl Send for FittedLabelBinarizer
impl Sync for FittedLabelBinarizer
impl Unpin for FittedLabelBinarizer
impl UnsafeUnpin for FittedLabelBinarizer
impl UnwindSafe for FittedLabelBinarizer
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
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<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.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§unsafe fn to_subset_unchecked(&self) -> SS
unsafe 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.