kmeans-par: Sequential and parallel implementations of Lloyd's algorithm.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
Warnings:
- 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
Sequential and parallel implementations of Lloyd's algorithm for k-means clustering, adapted from Marlow's "Parallel and Concurrent Programming in Haskell".
Properties
| Versions | 1.0.2, 1.1.0, 1.2.0, 1.3.0, 1.4.0, 1.4.1, 1.4.2, 1.5.0, 1.5.1, 2.0.0 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4 && <5), parallel, semigroups, vector [details] |
| License | MIT |
| Author | vi |
| Maintainer | vi <me@vikramverma.com>, Simon Alling <alling.simon@gmail.com> |
| Category | Algorithm |
| Bug tracker | https://github.com/SimonAlling/kmeans-par/issues |
| Source repo | head: git clone https://github.com/SimonAlling/kmeans-par |
| Uploaded | by SimonAlling at 2019-11-07T20:54:03Z |
Modules
- Algorithms
- Lloyd
- Algorithms.Lloyd.Sequential
- Algorithms.Lloyd.Strategies
- Lloyd
- Data
- Data.Metric
Downloads
- kmeans-par-2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees