pub struct EnhancedFactorAnalysis<F> {
pub n_factors: usize,
pub config: FactorAnalysisConfig,
pub results: Option<FactorAnalysisResult<F>>,
/* private fields */
}Expand description
Enhanced Factor Analysis
Fields§
§n_factors: usizeNumber of factors
config: FactorAnalysisConfigConfiguration
results: Option<FactorAnalysisResult<F>>Results
Implementations§
Source§impl<F> EnhancedFactorAnalysis<F>where
F: Float + Zero + One + Copy + Send + Sync + SimdUnifiedOps + FromPrimitive + Display + Sum + ScalarOperand,
impl<F> EnhancedFactorAnalysis<F>where
F: Float + Zero + One + Copy + Send + Sync + SimdUnifiedOps + FromPrimitive + Display + Sum + ScalarOperand,
Sourcepub fn new(n_factors: usize, config: FactorAnalysisConfig) -> StatsResult<Self>
pub fn new(n_factors: usize, config: FactorAnalysisConfig) -> StatsResult<Self>
Create new factor analysis
Sourcepub fn fit(
&mut self,
data: &ArrayView2<'_, F>,
) -> StatsResult<&FactorAnalysisResult<F>>
pub fn fit( &mut self, data: &ArrayView2<'_, F>, ) -> StatsResult<&FactorAnalysisResult<F>>
Fit factor analysis to data using the full iterative EM algorithm (Rubin & Thayer, 1982)
Sourcepub fn communalities(&self) -> Option<&Array1<F>>
pub fn communalities(&self) -> Option<&Array1<F>>
Get communalities
Auto Trait Implementations§
impl<F> Freeze for EnhancedFactorAnalysis<F>where
F: Freeze,
impl<F> RefUnwindSafe for EnhancedFactorAnalysis<F>where
F: RefUnwindSafe,
impl<F> Send for EnhancedFactorAnalysis<F>where
F: Send,
impl<F> Sync for EnhancedFactorAnalysis<F>where
F: Sync,
impl<F> Unpin for EnhancedFactorAnalysis<F>where
F: Unpin,
impl<F> UnsafeUnpin for EnhancedFactorAnalysis<F>where
F: UnsafeUnpin,
impl<F> UnwindSafe for EnhancedFactorAnalysis<F>where
F: UnwindSafe + RefUnwindSafe,
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> 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.