@hackage tdigest0.3.1
On-line accumulation of rank-based statistics
Categories
License
BSD-3-Clause
Maintainer
Oleg Grenrus <oleg.grenrus@iki.fi>
Links
Versions
Installation
Tested Compilers
Dependencies (8)
- base >=4.12.0.0 && <4.22
- binary >=0.8.6.0 && <0.10
- deepseq >=1.4.4.0 && <1.6
- foldable1-classes-compat >=0.1 && <0.2
- reducers >=3.12.2 && <3.13
- transformers >=0.5.6.2 && <0.7 Show all…
Dependents (17)
@hackage/wrecker, @hackage/online, @hackage/servant-http-streams, @hackage/mealy, @hackage/numhask-histogram, @hackage/tdigest-Chart, Show all…
tdigest
A new data structure for accurate on-line accumulation of rank-based statistics such as quantiles and trimmed means.
See original paper: "Computing extremely accurate quantiles using t-digest" by Ted Dunning and Otmar Ertl
Synopsis
λ *Data.TDigest > median (tdigest [1..1000] :: TDigest 3)
Just 499.0090729817737
Benchmarks
Using 50M exponentially distributed numbers:
- average: 16s; incorrect approximation of median, mostly to measure prng speed
- sorting using
vector-algorithms: 33s; using 1000MB of memory - sparking t-digest (using some
par): 53s - buffered t-digest: 68s
- sequential t-digest: 65s
Example histogram
tdigest-simple -m tdigest -d standard -s 100000 -c 10 -o output.svg -i 34
cp output.svg example.svg
inkscape --export-png=example.png --export-dpi=80 --export-background-opacity=0 --without-gui example.svg
