Skip to main content
. 2013 Jul 17;13(7):9160–9173. doi: 10.3390/sl30709160

Algorithm 2 DWF method
(2-1) The training and fitting stages.

Require: Training datasets, St = {(x1, y1), …, (xmt, ymt)}, t = 1, …, T, and the mean measurement time, wt, of each dataset.
1: for t = 1, …, T do
2:  Train a classifier, ft, on St;
3: end for
4: for t = 1, …, T do
5:  Estimate the optimal weights, { β1t,… βTt}, of {f1, …, fT} for St using the appropriate technique;
6: end for
7: Receive a T × T matrix, βij;
8: For a classifier, i.e., ft0, fit curve, Ct0(w), with {( βt01, ω1), …, ( βt0T, ωT)};
9: Revise the t0th row vector, βt0, as [Ct0(w1), …, Ct0(wT)], by means of scaling each column vector of βij;
10: for t = 1, …, T except t0 do
11:  Fit curve Ct(w) with {( βt1, w1), …, ( βtT, wT)};
12: end for
Ensure: The classifiers, ft, and the corresponding fitting functions, Ct(w), t = 1, …, T.


(2-2) The testing stage.

Require: Test the dataset, XT+n, and the mean measurement time, wT+n, n > 0; the classifiers, ft, and the corresponding fitting functions, Ct(w), t = 1, …, T.
 1: for t = 1, …, T do
 2:  Calculate the weight of ft at time wT+n, namely Ct(wT+n);
 3: end for
 4: Test XT+n using the classifier ensemble, hT+n=t=1TCt(wT+n)ft;
 5: Estimate the labels: YT+n = hT+n(XT+n);
Ensure: Estimated labels YT+n.