Lib.rs

› Algorithms
#clustering #cluster #data-science

cogset

Generic implementations of clustering algorithms. Includes k-means, DBSCAN and OPTICS.

by Huon Wilson

3 unstable releases

Uses old Rust 2015

0.2.0 Apr 29, 2015
0.1.1 Apr 27, 2015
0.1.0 Apr 10, 2015

#1955 in Algorithms

Download history 80/week @ 2023-12-09 70/week @ 2023-12-16 19/week @ 2023-12-23 195/week @ 2023-12-30 276/week @ 2024-01-06 161/week @ 2024-01-13 98/week @ 2024-01-20 203/week @ 2024-01-27 239/week @ 2024-02-03 117/week @ 2024-02-10 216/week @ 2024-02-17 173/week @ 2024-02-24 201/week @ 2024-03-02 155/week @ 2024-03-09 356/week @ 2024-03-16 325/week @ 2024-03-23

1,072 downloads per month

MIT/Apache

40KB
734 lines

cogset

Build Status

A cluster

Generic implementations of clustering algorithms.

Documentation, crates.io.

lib.rs:

Clustering algorithms.

A cluster

This crate provides generic implementations of clustering algorithms, allowing them to work with any back-end "point database" that implements the required operations, e.g. one might be happy with using the naive collection BruteScan from this crate, or go all out and implement a specialised R*-tree for optimised performance.

Density-based clustering algorithms:

  • DBSCAN (Dbscan)
  • OPTICS (Optics)

Others:

  • k-means (Kmeans)

Source.

Installation

Add the following to your Cargo.toml file:

[dependencies]
cogset = "0.1"

Dependencies

~20KB