pub struct NMF { /* private fields */ }
Expand description
Non-negative Matrix Factorization (NMF)
Finds two non-negative matrices W and H whose product approximates the non-negative input matrix V. The objective function is minimized with multiplicative update rules.
Implementations§
Source§impl NMF
impl NMF
Sourcepub fn with_solver(self, solver: &str) -> Self
pub fn with_solver(self, solver: &str) -> Self
Set the solver
Sourcepub fn with_beta_loss(self, beta: f64) -> Self
pub fn with_beta_loss(self, beta: f64) -> Self
Set the beta divergence parameter
Sourcepub fn with_max_iter(self, maxiter: usize) -> Self
pub fn with_max_iter(self, maxiter: usize) -> Self
Set maximum iterations
Sourcepub fn with_tolerance(self, tol: f64) -> Self
pub fn with_tolerance(self, tol: f64) -> Self
Set tolerance
Sourcepub fn with_random_state(self, seed: u64) -> Self
pub fn with_random_state(self, seed: u64) -> Self
Set random state
Sourcepub fn with_regularization(self, alpha: f64, l1ratio: f64) -> Self
pub fn with_regularization(self, alpha: f64, l1ratio: f64) -> Self
Set regularization parameters
Sourcepub fn components(&self) -> Option<&Array2<f64>>
pub fn components(&self) -> Option<&Array2<f64>>
Get the components (H matrix)
Sourcepub fn coefficients(&self) -> Option<&Array2<f64>>
pub fn coefficients(&self) -> Option<&Array2<f64>>
Get the coefficients (W matrix)
Sourcepub fn reconstruction_error(&self) -> Option<f64>
pub fn reconstruction_error(&self) -> Option<f64>
Get reconstruction error
Sourcepub fn n_iterations(&self) -> Option<usize>
pub fn n_iterations(&self) -> Option<usize>
Get number of iterations run
Trait Implementations§
Auto Trait Implementations§
impl Freeze for NMF
impl RefUnwindSafe for NMF
impl Send for NMF
impl Sync for NMF
impl Unpin for NMF
impl UnwindSafe for NMF
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> 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.