pub struct EnhancedPCA { /* private fields */ }
Expand description
Enhanced PCA with memory optimization and adaptive processing
Implementations§
Source§impl EnhancedPCA
impl EnhancedPCA
Sourcepub fn new(
n_components: usize,
center: bool,
memory_limitmb: usize,
) -> Result<Self>
pub fn new( n_components: usize, center: bool, memory_limitmb: usize, ) -> Result<Self>
Create a new enhanced PCA
Sourcepub fn with_randomized_svd(self, userandomized: bool) -> Self
pub fn with_randomized_svd(self, userandomized: bool) -> Self
Enable randomized SVD for large datasets
Sourcepub fn fit(&mut self, x: &ArrayView2<'_, f64>) -> Result<()>
pub fn fit(&mut self, x: &ArrayView2<'_, f64>) -> Result<()>
Fit the PCA model with adaptive processing
Sourcepub fn transform(&self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
pub fn transform(&self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
Transform data using fitted PCA
Sourcepub fn fit_transform(&mut self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
pub fn fit_transform(&mut self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
Fit and transform in one step
Sourcepub fn explained_variance_ratio(&self) -> Option<Array1<f64>>
pub fn explained_variance_ratio(&self) -> Option<Array1<f64>>
Get explained variance ratio
Sourcepub fn components(&self) -> Option<&Array2<f64>>
pub fn components(&self) -> Option<&Array2<f64>>
Get the components
Sourcepub fn processing_strategy(&self) -> &ProcessingStrategy
pub fn processing_strategy(&self) -> &ProcessingStrategy
Get the processing strategy
Auto Trait Implementations§
impl Freeze for EnhancedPCA
impl RefUnwindSafe for EnhancedPCA
impl Send for EnhancedPCA
impl Sync for EnhancedPCA
impl Unpin for EnhancedPCA
impl UnwindSafe for EnhancedPCA
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> 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.