#clustering #cluster #means #simd-vector

nightly kmeans

Small and fast library for k-means clustering calculations

4 releases (2 breaking)

0.11.0 Oct 8, 2024
0.10.0 Jun 21, 2024
0.2.1 Jan 3, 2024
0.2.0 Oct 8, 2020
0.1.0 Jul 27, 2019

#257 in Algorithms

Download history 47/week @ 2024-07-28 3/week @ 2024-08-04 4/week @ 2024-09-15 6/week @ 2024-09-22 25/week @ 2024-09-29 177/week @ 2024-10-06 32/week @ 2024-10-13 21/week @ 2024-10-20 44/week @ 2024-10-27

274 downloads per month
Used in 2 crates

Apache-2.0

105KB
1.5K SLoC

kmeans

Current Crates.io Version docs

kmeans is a small and fast library for k-means clustering calculations. It requires a nightly compiler with the portable_simd feature to work.

Here is a small example, using kmean++ as initialization method and lloyd as k-means variant:

use kmeans::*;

fn main() {
    let (sample_cnt, sample_dims, k, max_iter) = (20000, 200, 4, 100);

    // Generate some random data
    let mut samples = vec![0.0f64;sample_cnt * sample_dims];
    samples.iter_mut().for_each(|v| *v = rand::random());

    // Calculate kmeans, using kmean++ as initialization-method
    // KMeans<_, 8> specifies to use f64 SIMD vectors with 8 lanes (e.g. AVX512)
    let kmean: KMeans<_, 8> = KMeans::new(samples, sample_cnt, sample_dims);
    let result = kmean.kmeans_lloyd(k, max_iter, KMeans::init_kmeanplusplus, &KMeansConfig::default());

    println!("Centroids: {:?}", result.centroids);
    println!("Cluster-Assignments: {:?}", result.assignments);
    println!("Error: {}", result.distsum);
}

Datastructures

For performance-reasons, all calculations are done on bare vectors, using hand-written SIMD intrinsics from the packed_simd crate. All vectors are stored row-major, so each sample is stored in a consecutive block of memory.

Supported variants / algorithms

  • lloyd (standard kmeans)
  • minibatch

Supported centroid initialization methods

  • KMean++
  • random partition
  • random sample

Dependencies

~2MB
~40K SLoC