Combined weak classifiers
暂无分享,去创建一个
To obtain classification systems with both good generalization performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers, where weak classifiers are linear classifiers (perceptrons) which can do a little better than making random guesses. A randomized algorithm is proposed to find the weak classifiers. They are then combined through a majority vote. As demonstrated through systematic experiments, the method developed is able to obtain combinations of weak classifiers with good generalization performance and a fast training time on a variety of test problems and real applications.
[1] Harris Drucker,et al. Improving Performance in Neural Networks Using a Boosting Algorithm , 1992, NIPS.
[2] Yoav Freund,et al. A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.
[3] L. Breiman. Pasting Bites Together For Prediction In Large Data Sets And On-Line , 1996 .
[4] Chuanyi Ji,et al. Combinations of Weak Classifiers , 1996, NIPS.
[5] Leo Breiman,et al. Bias, Variance , And Arcing Classifiers , 1996 .