# Equal-width Interval Binning¶

Equal-width Interval Binning algorithm divides the range of values into $$k$$ subintervals of equal width that is determined by

$h = \frac{max(Y)-min(Y)}{k}.$

Input Parameters

Parameter Type Constraint Description Remarks
$$Y$$ $$Y \in \mathbb R^N$$ or $$Y$$ is continuous data For discrete data, $$N \in \mathbb{N}$$ ; for continuous data, input data bounded from below and above None None
$$k$$ $$k \in \mathbb N$$ None None None

Output Parameters

Parameter Type Constraint Description Remarks
$$\hat{Y}$$ $$\hat{Y} \in \mathbb R^{k+1}$$ None Discrete data set of length $$k+1$$ None

Single Steps using the Algorithm

References