pub struct LinearDiscriminantAnalysis {
pub solver: LDASolver,
pub shrinkage: Option<f64>,
pub n_components: Option<usize>,
pub priors: Option<Array1<f64>>,
pub store_covariance: bool,
}Expand description
Linear Discriminant Analysis (LDA)
LDA is a dimensionality reduction technique that finds linear combinations of features that best separate different classes. It assumes that all classes have the same covariance structure.
Fields§
§solver: LDASolverSolver type for eigenvalue decomposition
shrinkage: Option<f64>Whether to shrink the covariance estimate
n_components: Option<usize>Number of components to keep (None = automatic)
priors: Option<Array1<f64>>Prior probabilities for each class (None = empirical)
store_covariance: boolStore training fit results
Implementations§
Source§impl LinearDiscriminantAnalysis
impl LinearDiscriminantAnalysis
Sourcepub fn with_solver(self, solver: LDASolver) -> Self
pub fn with_solver(self, solver: LDASolver) -> Self
Set the solver type
Sourcepub fn with_shrinkage(self, shrinkage: f64) -> Self
pub fn with_shrinkage(self, shrinkage: f64) -> Self
Set shrinkage parameter for covariance regularization
Sourcepub fn with_n_components(self, n_components: usize) -> Self
pub fn with_n_components(self, n_components: usize) -> Self
Set number of components to keep
Sourcepub fn with_priors(self, priors: Array1<f64>) -> Self
pub fn with_priors(self, priors: Array1<f64>) -> Self
Set prior probabilities
Sourcepub fn with_store_covariance(self, store: bool) -> Self
pub fn with_store_covariance(self, store: bool) -> Self
Set whether to store covariance matrix
Sourcepub fn fit(
&self,
x: ArrayView2<'_, f64>,
y: ArrayView1<'_, i32>,
) -> Result<LDAResult>
pub fn fit( &self, x: ArrayView2<'_, f64>, y: ArrayView1<'_, i32>, ) -> Result<LDAResult>
Fit the LDA model
Sourcepub fn transform(
&self,
x: ArrayView2<'_, f64>,
result: &LDAResult,
) -> Result<Array2<f64>>
pub fn transform( &self, x: ArrayView2<'_, f64>, result: &LDAResult, ) -> Result<Array2<f64>>
Transform data to discriminant space
Sourcepub fn predict(
&self,
x: ArrayView2<'_, f64>,
result: &LDAResult,
) -> Result<Array1<i32>>
pub fn predict( &self, x: ArrayView2<'_, f64>, result: &LDAResult, ) -> Result<Array1<i32>>
Predict class labels
Sourcepub fn decision_function(
&self,
x: ArrayView2<'_, f64>,
result: &LDAResult,
) -> Result<Array2<f64>>
pub fn decision_function( &self, x: ArrayView2<'_, f64>, result: &LDAResult, ) -> Result<Array2<f64>>
Compute decision function scores
Sourcepub fn predict_proba(
&self,
x: ArrayView2<'_, f64>,
result: &LDAResult,
) -> Result<Array2<f64>>
pub fn predict_proba( &self, x: ArrayView2<'_, f64>, result: &LDAResult, ) -> Result<Array2<f64>>
Compute prediction probabilities using softmax
Trait Implementations§
Source§impl Clone for LinearDiscriminantAnalysis
impl Clone for LinearDiscriminantAnalysis
Source§fn clone(&self) -> LinearDiscriminantAnalysis
fn clone(&self) -> LinearDiscriminantAnalysis
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · 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 LinearDiscriminantAnalysis
impl Debug for LinearDiscriminantAnalysis
Auto Trait Implementations§
impl Freeze for LinearDiscriminantAnalysis
impl RefUnwindSafe for LinearDiscriminantAnalysis
impl Send for LinearDiscriminantAnalysis
impl Sync for LinearDiscriminantAnalysis
impl Unpin for LinearDiscriminantAnalysis
impl UnsafeUnpin for LinearDiscriminantAnalysis
impl UnwindSafe for LinearDiscriminantAnalysis
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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
impl<T> Read<Exclusive, BecauseExclusive> 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.