Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.