adaboost: Perform Classic AdaBoost
In EdwinTh/rareboost:

Description Usage Arguments Details Value References Examples

This is the implementation of the classic AdaBoost algorithm.

1	adaboost(x, yname, treedepth = 3, event = 1, m = 50)

`x`	A dataframe.
`yname`	A character vector indicating the column name of the binary target.
`treedepth`	The maximal depth of the tree.
`event`	Value that indicates the even in 'y'.
`m`	The number of trees.

This is the AdaBoost implementation as described on page 258 of the articel.

A list containing: * The predicted values of x. * The confidence of the predictions. * A list with the 'm' trees. * The vector with alpha values. * The column name of 'y'.

Joshi, Kumar, Agarwal 2001