pub struct AdvancedPCA { /* private fields */ }
Expand description
✅ Advanced MODE: Fast PCA with memory pooling
Implementations§
Source§impl AdvancedPCA
impl AdvancedPCA
Sourcepub fn new(_n_components: usize, _n_samples_hint: usize, hint: usize) -> Self
pub fn new(_n_components: usize, _n_samples_hint: usize, hint: usize) -> Self
Create a new optimized PCA with memory pooling
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 the PCA model and transform the data
Sourcepub fn components(&self) -> Option<&Array2<f64>>
pub fn components(&self) -> Option<&Array2<f64>>
Get the fitted components
Sourcepub fn explained_variance_ratio(&self) -> Result<Array1<f64>>
pub fn explained_variance_ratio(&self) -> Result<Array1<f64>>
Get the explained variance ratio
Sourcepub fn fast_transform(&mut self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
pub fn fast_transform(&mut self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
✅ Advanced OPTIMIZATION: Fast transform with memory pooling
Sourcepub fn performance_stats(&self) -> &PoolStats
pub fn performance_stats(&self) -> &PoolStats
Get memory pool performance statistics
Sourcepub fn cleanup_cache(&mut self)
pub fn cleanup_cache(&mut self)
Clean up old cache entries
Sourcepub fn transform(&mut self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
pub fn transform(&mut self, x: &ArrayView2<'_, f64>) -> Result<Array2<f64>>
Transform data using the fitted PCA model
Auto Trait Implementations§
impl Freeze for AdvancedPCA
impl RefUnwindSafe for AdvancedPCA
impl Send for AdvancedPCA
impl Sync for AdvancedPCA
impl Unpin for AdvancedPCA
impl UnwindSafe for AdvancedPCA
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.