pub struct OpticsAnalysis<F: Float> { /* private fields */ }Expand description
The analysis from running OPTICS on a dataset, this allows you iterate over the data points and access their core and reachability distances. The ordering of the points also doesn’t match that of the dataset instead ordering based on the clustering structure worked out during analysis.
Implementations§
Trait Implementations§
Source§impl<F: Clone + Float> Clone for OpticsAnalysis<F>
impl<F: Clone + Float> Clone for OpticsAnalysis<F>
Source§fn clone(&self) -> OpticsAnalysis<F>
fn clone(&self) -> OpticsAnalysis<F>
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<F: Debug + Float> Debug for OpticsAnalysis<F>
impl<F: Debug + Float> Debug for OpticsAnalysis<F>
Source§impl<I, F: Float> Index<I> for OpticsAnalysis<F>where
I: SliceIndex<[Sample<F>]>,
impl<I, F: Float> Index<I> for OpticsAnalysis<F>where
I: SliceIndex<[Sample<F>]>,
Source§impl<F: PartialEq + Float> PartialEq for OpticsAnalysis<F>
impl<F: PartialEq + Float> PartialEq for OpticsAnalysis<F>
Source§impl<F: Float, D: Distance<F>, N: NearestNeighbour> Transformer<ArrayBase<ViewRepr<&F>, Dim<[usize; 2]>>, OpticsAnalysis<F>> for OpticsValidParams<F, D, N>
impl<F: Float, D: Distance<F>, N: NearestNeighbour> Transformer<ArrayBase<ViewRepr<&F>, Dim<[usize; 2]>>, OpticsAnalysis<F>> for OpticsValidParams<F, D, N>
impl<F: Float> StructuralPartialEq for OpticsAnalysis<F>
Auto Trait Implementations§
impl<F> Freeze for OpticsAnalysis<F>
impl<F> RefUnwindSafe for OpticsAnalysis<F>where
F: RefUnwindSafe,
impl<F> Send for OpticsAnalysis<F>
impl<F> Sync for OpticsAnalysis<F>
impl<F> Unpin for OpticsAnalysis<F>
impl<F> UnwindSafe for OpticsAnalysis<F>where
F: UnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<B> Stagewise for B
impl<B> Stagewise for B
§fn chain_shrunk<C, F>(
self,
corrector: Shrunk<C, F>,
) -> ResidualChainParams<B, C, F>where
F: Float,
fn chain_shrunk<C, F>(
self,
corrector: Shrunk<C, F>,
) -> ResidualChainParams<B, C, F>where
F: Float,
Compose
self (as the base model) with a [Shrunk]-wrapped corrector,
which will be trained on the residuals left by self. Further stages can
be appended by calling .chain(...) or .chain_shrunk(...) on the
returned [ResidualChainParams]. Read more§fn chain<C, F, E>(self, corrector: C) -> ResidualChainParams<B, C, F>
fn chain<C, F, E>(self, corrector: C) -> ResidualChainParams<B, C, F>
Compose
self (as the base model) with corrector, which will be
trained on the residuals left by self. The corrector is used without
shrinkage (equivalent to shrink_by(1.0)). Further stages can be
appended by calling .chain(...) or .chain_shrunk(...) on the
returned [ResidualChainParams]. Read more§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.