论文信息 - Randomizing Outputs to Increase Prediction Accuracy

Randomizing Outputs to Increase Prediction Accuracy

Bagging and boosting reduce error by changing both the inputs and outputs to form perturbed training sets, growing predictors on these perturbed training sets and combining them. An interesting question is whether it is possible to get comparable performance by perturbing the outputs alone. Two methods of randomizing outputs are experimented with. One is called output smearing and the other output flipping. Both are shown to consistently do better than bagging.

Leo Breiman | L. Breiman

[1] Leo Breiman,et al. Classification and Regression Trees , 1984 .

[2] J. Friedman. Multivariate adaptive regression splines , 1990 .

[3] Elie Bienenstock,et al. Neural Networks and the Bias/Variance Dilemma , 1992, Neural Computation.

[4] Tal Grossman,et al. Use of Bad Training Data for Better Predictions , 1993, NIPS.

[5] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[6] Yoav Freund,et al. Experiments with a New Boosting Algorithm , 1996, ICML.

[7] L. Breiman. Heuristics of instability and stabilization in model selection , 1996 .

[8] Guozhong An,et al. The Effects of Adding Noise During Backpropagation Training on a Generalization Performance , 1996, Neural Computation.

[9] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[10] L. Breiman. Arcing classifier (with discussion and a rejoinder by the author) , 1998 .

[11] Leo Breiman,et al. Prediction Games and Arcing Algorithms , 1999, Neural Computation.

[12] Thomas G. Dietterich. An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization , 2000, Machine Learning.

[13] Leo Breiman,et al. Bagging Predictors , 1996, Machine Learning.