Chroma.Limits.Jenks

Jenks natural breaks optimization is a clustering algorithm scheme for data to reduce the variance within classes and maximize the variance between classes.

Definition

binned : Int -> Scale -> Nonempty (Array Float)

Return the values in Scale into the given number of bins.

Analyze.analyze (Nonempty.Nonempty 3 [1,3,4,3])
|> binned 3
-->  Nonempty.Nonempty [1] [[3,3,3], [4]]

limit : Int -> Scale -> Nonempty Float

Create bins number of results using the given scale.

Analyze.analyze (Nonempty.Nonempty 3 [1,3,4,3])
|> limit 3
-->  Nonempty.Nonempty 1 [3,4]

Helpers

initVarianceCombinations : Int -> Int -> Int -> Int -> Float

TBD

initLowerClassLimits : Int -> Int -> Int -> Int

TBD

getMatrix : Int -> Scale -> JenksResult

TBD

README
About
59 versions
Source

Modules

newmana/chroma-elm/17.1.0

Chroma.Limits.Jenks

Definition

Helpers

Modules

Main API

Input

Output

Colors

Limits

Operations

Helpers