pub struct GaussianMixtureModel<F> {
pub n_components: usize,
pub config: GMMConfig,
pub parameters: Option<GMMParameters<F>>,
pub convergence_history: Vec<F>,
/* private fields */
}Expand description
Gaussian Mixture Model with EM algorithm
Fields§
§n_components: usizeNumber of components
config: GMMConfigConfiguration
parameters: Option<GMMParameters<F>>Fitted parameters
convergence_history: Vec<F>Convergence history
Implementations§
Source§impl<F> GaussianMixtureModel<F>where
F: Float + Zero + One + Copy + Send + Sync + SimdUnifiedOps + FromPrimitive + Display + Sum<F> + ScalarOperand,
impl<F> GaussianMixtureModel<F>where
F: Float + Zero + One + Copy + Send + Sync + SimdUnifiedOps + FromPrimitive + Display + Sum<F> + ScalarOperand,
Sourcepub fn new(_ncomponents: usize, config: GMMConfig) -> StatsResult<Self>
pub fn new(_ncomponents: usize, config: GMMConfig) -> StatsResult<Self>
Create new Gaussian Mixture Model
Sourcepub fn fit(
&mut self,
data: &ArrayView2<'_, F>,
) -> StatsResult<&GMMParameters<F>>
pub fn fit( &mut self, data: &ArrayView2<'_, F>, ) -> StatsResult<&GMMParameters<F>>
Fit GMM to data using EM algorithm
Sourcepub fn predict(&self, data: &ArrayView2<'_, F>) -> StatsResult<Array1<usize>>
pub fn predict(&self, data: &ArrayView2<'_, F>) -> StatsResult<Array1<usize>>
Predict cluster assignments
Sourcepub fn score_samples(&self, data: &ArrayView2<'_, F>) -> StatsResult<Array1<F>>
pub fn score_samples(&self, data: &ArrayView2<'_, F>) -> StatsResult<Array1<F>>
Compute probability density for new data points
Auto Trait Implementations§
impl<F> Freeze for GaussianMixtureModel<F>where
F: Freeze,
impl<F> RefUnwindSafe for GaussianMixtureModel<F>where
F: RefUnwindSafe,
impl<F> Send for GaussianMixtureModel<F>where
F: Send,
impl<F> Sync for GaussianMixtureModel<F>where
F: Sync,
impl<F> Unpin for GaussianMixtureModel<F>where
F: Unpin,
impl<F> UnwindSafe for GaussianMixtureModel<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
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.