pub struct DbscanValidParams<F: Float, D: Distance<F>, N: NearestNeighbour> { /* private fields */ }
Expand description
The set of hyperparameters that can be specified for the execution of the DBSCAN algorithm.
Implementations§
Source§impl<F: Float, D: Distance<F>, N: NearestNeighbour> DbscanValidParams<F, D, N>
impl<F: Float, D: Distance<F>, N: NearestNeighbour> DbscanValidParams<F, D, N>
Sourcepub fn minimum_points(&self) -> usize
pub fn minimum_points(&self) -> usize
Minimum number of neighboring points a point needs to have to be a core
point and not a noise point.
Trait Implementations§
Source§impl<F: Clone + Float, D: Clone + Distance<F>, N: Clone + NearestNeighbour> Clone for DbscanValidParams<F, D, N>
impl<F: Clone + Float, D: Clone + Distance<F>, N: Clone + NearestNeighbour> Clone for DbscanValidParams<F, D, N>
Source§fn clone(&self) -> DbscanValidParams<F, D, N>
fn clone(&self) -> DbscanValidParams<F, D, N>
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, D: Debug + Distance<F>, N: Debug + NearestNeighbour> Debug for DbscanValidParams<F, D, N>
impl<F: Debug + Float, D: Debug + Distance<F>, N: Debug + NearestNeighbour> Debug for DbscanValidParams<F, D, N>
Source§impl<F: PartialEq + Float, D: PartialEq + Distance<F>, N: PartialEq + NearestNeighbour> PartialEq for DbscanValidParams<F, D, N>
impl<F: PartialEq + Float, D: PartialEq + Distance<F>, N: PartialEq + NearestNeighbour> PartialEq for DbscanValidParams<F, D, N>
Source§impl<F: Float, D: Data<Elem = F>, DF: Distance<F>, N: NearestNeighbour> Transformer<&ArrayBase<D, Dim<[usize; 2]>>, ArrayBase<OwnedRepr<Option<usize>>, Dim<[usize; 1]>>> for DbscanValidParams<F, DF, N>
impl<F: Float, D: Data<Elem = F>, DF: Distance<F>, N: NearestNeighbour> Transformer<&ArrayBase<D, Dim<[usize; 2]>>, ArrayBase<OwnedRepr<Option<usize>>, Dim<[usize; 1]>>> for DbscanValidParams<F, DF, N>
Source§impl<F: Float, D: Data<Elem = F>, DF: Distance<F>, N: NearestNeighbour, T> Transformer<DatasetBase<ArrayBase<D, Dim<[usize; 2]>>, T>, DatasetBase<ArrayBase<D, Dim<[usize; 2]>>, ArrayBase<OwnedRepr<Option<usize>>, Dim<[usize; 1]>>>> for DbscanValidParams<F, DF, N>
impl<F: Float, D: Data<Elem = F>, DF: Distance<F>, N: NearestNeighbour, T> Transformer<DatasetBase<ArrayBase<D, Dim<[usize; 2]>>, T>, DatasetBase<ArrayBase<D, Dim<[usize; 2]>>, ArrayBase<OwnedRepr<Option<usize>>, Dim<[usize; 1]>>>> for DbscanValidParams<F, DF, N>
impl<F: Float, D: Distance<F>, N: NearestNeighbour> StructuralPartialEq for DbscanValidParams<F, D, N>
Auto Trait Implementations§
impl<F, D, N> Freeze for DbscanValidParams<F, D, N>
impl<F, D, N> RefUnwindSafe for DbscanValidParams<F, D, N>
impl<F, D, N> Send for DbscanValidParams<F, D, N>
impl<F, D, N> Sync for DbscanValidParams<F, D, N>
impl<F, D, N> Unpin for DbscanValidParams<F, D, N>
impl<F, D, N> UnwindSafe for DbscanValidParams<F, D, N>
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<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.