Skip to main content
. 2013 Sep 4;13(9):11603–11635. doi: 10.3390/s130911603

Algorithm 1 Outline of Real AdaBoost.

Input: Training data samples, (si, li), i = 1,2,…, N; si ∈ ℝn, li ∈ {+1, −1}
Initialization: Set uniform sample weights, w1(i)=1N.
Iteration: For t = 1, 2, …, T, repeat the following steps:
  1. Train the weak classifier to obtain a class probability estimate, P(l = 1∣s) ∈ [0, 1], using the weighted samples.

  2. Set ht(s)=12logP(l=1|s)P(l=1|s).

  3. Update the sample weights: wi(t+1)=wi(t)exp(yiht(si)), i = 1, 2, …, N.

  4. Normalize the weight distribution: wi(t+1)=wi(t+1)i=1Nwi(t+1).

Output: The final strong classifier, H(s)=sign(t=1Tht(s))