bins.merr
.bins.move
- Compute the best move of a value from one bin to its neighborbins.split
- Split a bin into two bins optimally.
bins.merge
- Merges the two bins yielding the largest gain in error reduction.
bins.move.iter
- Apply bins.move
until there's no change. Can only reduce the error.
bins.split.iter
Iterate to repeatedly apply bins.split
.
bins.merge.iter
Iterate to repeatedly apply bins.merge
.
bins.move(xval, xtbl, binlo, binhi, binct, target.bins, verbose = F)
bins.split(xval, xtbl, binlo, binhi, binct, target.bins, force = F, verbose = F)
bins.merge(xval, xtbl, binlo, binhi, binct, target.bins, force = F, verbose = F)
bins.move.iter(lst, target.bins, verbose = F)
bins.split.iter(lst, target.bins, exact.groups = F, verbose = F)
bins.merge.iter(lst, target.bins, exact.groups = F, verbose = F)
names(xtbl)
.table(x)
.TRUE
, prints resulting binct
.TRUE
, splits or merges bins regardless of whether the best gain is positive.xval, xtbl, binlo, binhi, binct
.FALSE
, run until either the target.bins is
reached or there's no more splits or merges that reduce the error.
Otherwise (TRUE
), run until the target.bins is reached, even if that
increases the error.table(x)
.
names(xtbl)
.
bins
, binr
, bins.greedy
, bins.quantiles