A continuous binning for discrete, sparse and concentrated observations

Journal article

Discrete observations from data which are obtained from sparse, and yet concentrated events are often observed (e.g. road accidents or murders). Traditional methods to compute summary statistics often include placing the data in discrete bins but for this type of data this approach often results in large numbers of empty bins for which no function or summary statistic can be computed.

Here, a method for dealing with sparse and concentrated observations is constructed, based on a sequence of non-overlapping bins of varying size, which gives a continuous interpolation of data for computing summary statistics of the values for the data, such as the mean.

The method presented here overcomes the problem which sparsity and concentration present when computing functions to represent the data. Implementation of the method presented here is facilitated via open access to the code.

A new method for computing functions over sparse and concentrated data is constructed.

The method allows straightforward functions to be computed over partitions of the data, such as the mean, but also more complicated functions, such as coefficients, ratios, correlations, regressions and others.

Rafael Prieto Curiel
Carmen Cabrera Arnau
Mara Torres Pinedo
Humberto González Ramírez
Steven Bishop
Vol 7: 2020
Sustainable Growth