[−][src]Crate kmedoids
k-Medoids Clustering with the FasterPAM Algorithm
Given a dissimilarity matrix of size n x n, use:
let mut rng = rand::thread_rng(); let mut meds = random_initialization(n, k, &mut rng); let (loss, numswap, numiter, assignment) = fasterpam(data, &mut meds, 100);
Re-exports
pub use crate::safeadd::SafeAdd; |
Modules
safeadd |
Functions
fasterpam | Run the FasterPAM algorithm. |
random_initialization | Random initialization |