Struct KMedoidsResult 

#[non_exhaustive]
pub struct KMedoidsResult {
    pub labels: Vec<usize>,
    pub medoid_indices: Vec<usize>,
    pub within_distances: Vec<f64>,
    pub total_within_distance: f64,
    pub n_iter: usize,
    pub converged: bool,
}

Result of k-medoids clustering.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

labels: Vec<usize>

Cluster label for each observation (0-indexed, length n).

medoid_indices: Vec<usize>

Medoid index for each cluster (length k).

within_distances: Vec<f64>

Within-cluster sum of distances for each cluster.

total_within_distance: f64

Total within-cluster distance.

n_iter: usize

Number of iterations performed.

converged: bool

Whether the algorithm converged (labels stabilized).

Trait Implementations

impl Clone for KMedoidsResult

fn clone(&self) -> KMedoidsResult

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for KMedoidsResult

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for KMedoidsResult

fn eq(&self, other: &KMedoidsResult) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for KMedoidsResult