ComputingComputer ScienceData MiningMachine LearningStatistical LearningBias-variance TradeoffClassificationEnsemble BalanceEnsemble LearningEnsemble MethodsNeural NetworksAdaboostBaggingBoostingEnsemble Learning TheoryMajority VotingTrainingVoting Classifiers
It has been shown that as the number of weak learners in a majority voting model is increased so does its generalization if those weak learners are uncorrelated or negatively correlated. Although some learning algorithms including bagging and boosting have been developed to create such weak learners, learners trained by these learning algorithms are actually not so weak in many applications. This paper presents a simple balanced ensemble learning method for producing weak learners. The idea of balanced ensemble learning is to change the learning force in the training process so that the training data points near to the decision boundaries would push the decision boundaries further while the training data points far away from the decision boundaries would drag the decision boundaries to themselves. The experimental results suggest that balanced ensemble learning is able to create learners being both weak and negatively correlated.
9
Leo Breiman · Machine Learning · 1996 · 17K citations · Full text
Leo Breiman · Machine Learning · 1996 · 16.4K citations · Full text
Adaptive Mixtures of Local Experts
Robert A. Jacobs, Michael I. Jordan, Steven J. Nowlan et al. · Neural Computation · 1991 · 5K citations
The Strength of Weak Learnability
Robert E. Schapire · Machine Learning · 1990 · 3.3K citations · Full text