Keywords
Computer scienceOverfittingEnsemble learningBoosting (machine learning)AdaBoostArtificial intelligenceMachine learningClassifier (UML)Bayesian probabilityPattern recognition (psychology)Artificial neural network
Affiliated Institutions
Related Publications
Classification and Regression by randomForest
Recently there has been a lot of interest in “ensemble learning” — methods that generate many classifiers and aggregate their results. Two well-known methods are boosting (see, ...
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively new development. They provide an explanation of the performance of state-of-the-art learning syste...
Boosting the margin: A new explanation for the effectiveness of voting methods
One of the surprising recurring phenomena observed in experiments with boosting is that the test error of the generated classifier usually does not increase as its size becomes ...
Approximate Splitting for Ensembles of Trees using Histograms
Recent work in classification indicates that significant improvements in accuracy can be obtained by growing an ensemble of classifiers and having them vote for the most popular...
Building projectable classifiers of arbitrary complexity
Conventional methods for classifier design often suffer from having two conflicting goals-to develop arbitrarily complex decision boundaries to suit a given problem, and at the ...
Publication Info
- Year
- 2000
- Type
- book-chapter
- Pages
- 1-15
- Citations
- 7433
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
7433
OpenAlex
Cite This
Thomas G. Dietterich
(2000).
Ensemble Methods in Machine Learning.
Lecture notes in computer science
, 1-15.
https://doi.org/10.1007/3-540-45014-9_1
Identifiers
- DOI
- 10.1007/3-540-45014-9_1