pub struct DistributedKMeans<F: Float> {
pub k: usize,
pub config: DistributedKMeansConfig,
pub centroids: Option<Array2<F>>,
pub partitions: Vec<DataPartition<F>>,
pub fault_coordinator: FaultToleranceCoordinator<F>,
pub load_balancer: LoadBalancingCoordinator,
pub performance_monitor: PerformanceMonitor,
pub message_coordinator: Option<MessagePassingCoordinator<F>>,
pub partitioner: DataPartitioner<F>,
pub current_iteration: usize,
pub convergence_history: Vec<ConvergenceInfo>,
pub global_inertia: f64,
}Expand description
Main distributed K-means clustering algorithm
Fields§
§k: usizeNumber of clusters
config: DistributedKMeansConfigConfiguration parameters
centroids: Option<Array2<F>>Current centroids
partitions: Vec<DataPartition<F>>Worker assignments and data partitions
fault_coordinator: FaultToleranceCoordinator<F>Fault tolerance coordinator
load_balancer: LoadBalancingCoordinatorLoad balancing coordinator
performance_monitor: PerformanceMonitorPerformance monitor
message_coordinator: Option<MessagePassingCoordinator<F>>Message passing coordinator
partitioner: DataPartitioner<F>Data partitioner
current_iteration: usizeCurrent iteration
convergence_history: Vec<ConvergenceInfo>Convergence history
global_inertia: f64Global inertia
Implementations§
Source§impl<F: Float + FromPrimitive + Debug + Send + Sync + 'static> DistributedKMeans<F>
impl<F: Float + FromPrimitive + Debug + Send + Sync + 'static> DistributedKMeans<F>
Sourcepub fn new(k: usize, config: DistributedKMeansConfig) -> Result<Self>
pub fn new(k: usize, config: DistributedKMeansConfig) -> Result<Self>
Create new distributed K-means instance
Sourcepub fn fit(&mut self, data: ArrayView2<'_, F>) -> Result<ClusteringResult<F>>
pub fn fit(&mut self, data: ArrayView2<'_, F>) -> Result<ClusteringResult<F>>
Fit the distributed K-means model to data
Sourcepub fn predict(&self, data: ArrayView2<'_, F>) -> Result<Array1<usize>>
pub fn predict(&self, data: ArrayView2<'_, F>) -> Result<Array1<usize>>
Predict cluster assignments for new data
Sourcepub fn convergence_history(&self) -> &[ConvergenceInfo]
pub fn convergence_history(&self) -> &[ConvergenceInfo]
Get convergence history
Sourcepub fn n_iterations(&self) -> usize
pub fn n_iterations(&self) -> usize
Get number of iterations performed
Sourcepub fn performance_monitor(&self) -> &PerformanceMonitor
pub fn performance_monitor(&self) -> &PerformanceMonitor
Get performance monitor
Sourcepub fn fault_coordinator(&self) -> &FaultToleranceCoordinator<F>
pub fn fault_coordinator(&self) -> &FaultToleranceCoordinator<F>
Get fault tolerance coordinator
Trait Implementations§
Auto Trait Implementations§
impl<F> Freeze for DistributedKMeans<F>
impl<F> RefUnwindSafe for DistributedKMeans<F>where
F: RefUnwindSafe,
impl<F> Send for DistributedKMeans<F>where
F: Send,
impl<F> !Sync for DistributedKMeans<F>
impl<F> Unpin for DistributedKMeans<F>
impl<F> UnwindSafe for DistributedKMeans<F>where
F: 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.