Crates.io | kodama |
lib.rs | kodama |
version | 0.3.0 |
source | src |
created_at | 2017-08-15 14:39:46.662398 |
updated_at | 2023-01-04 17:04:17.978034 |
description | Agglomerative hierarchical clustering. |
homepage | https://github.com/diffeo/kodama |
repository | https://github.com/diffeo/kodama |
max_upload_size | |
id | 27612 |
size | 2,666,473 |
This crate provides a fast implementation of agglomerative hierarchical clustering.
This library is released under the MIT license.
The ideas and implementation in this crate are heavily based on the work of
Daniel Müllner, and in particular, his 2011 paper,
Modern hierarchical, agglomerative clustering algorithms.
Parts of the implementation have also been inspired by his C++
library, fastcluster
.
Müllner's work, in turn, is based on the hierarchical clustering facilities
provided by MATLAB and
SciPy.
The runtime performance of this library is on par with Müllner's fastcluster
implementation.
For a more detailed example of how to use hierarchical clustering, see the example in the API documentation.
Add this to your Cargo.toml
:
[dependencies]
kodama = "0.3"
and this to your crate root:
extern crate kodama;
This repository includes
kodama-capi
,
which provides a C interface to hierarchical clustering.
This repository also includes Go FFI bindings via cgo to the aforementioned C API. Documentation for the Go library can be found at godoc.org/github.com/diffeo/kodama/go-kodama.