reservoir: Unweighted reservoir sampling
From https://en.wikipedia.org/wiki/Reservoir_sampling: "Reservoir sampling is a family of randomized algorithms for randomly choosing a sample of k items from a list S containing n items, where n is either a very large or unknown number. Typically n is large enough that the list doesn't fit into main memory." This package implements Jeffrey Vitter's Algorithm R http://www.cs.umd.edu/~samir/498/vitter.pdf, suitable for unweighted sampling from a collection of unknown size.
Downloads
- reservoir-0.2.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 0.2.0.0 |
---|---|
Change log | ChangeLog.md |
Dependencies | base (>=4.10 && <4.11), containers (>=0.5 && <0.6), random (>=1.1 && <1.2) [details] |
License | BSD-3-Clause |
Author | Mark Hay |
Maintainer | mah6@williams.edu |
Category | Math |
Home page | https://github.com/ahaym/reservoir |
Source repo | head: git clone https://github.com/ahaym/reservoir |
Uploaded | by haym at 2018-07-29T08:51:12Z |
Distributions | |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 665 total (2 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |