Keywords
Boosting (machine learning)AdaBoostArtificial intelligenceComputer scienceMachine learningDecision treePattern recognition (psychology)Word error rateMathematicsVotingNaive Bayes classifierStatisticsSupport vector machine
Affiliated Institutions
Related Publications
Additive logistic regression: a statistical view of boosting (With discussion and a rejoinder by the authors)
Boosting is one of the most important recent developments in\nclassification methodology. Boosting works by sequentially applying a\nclassification algorithm to reweighted versi...
Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy
Feature selection is an important problem for pattern classification systems. We study how to select good features according to the maximal statistical dependency criterion base...
Molecular Similarity Searching Using Atom Environments, Information-Based Feature Selection, and a Naïve Bayesian Classifier
A novel technique for similarity searching is introduced. Molecules are represented by atom environments, which are fed into an information-gain-based feature selection. A naïve...
The advantages of the Matthews correlation coefficient (MCC) over F1 score and accuracy in binary classification evaluation
Abstract Background To evaluate binary classifications and their confusion matrices, scientific researchers can employ several statistical rates, accordingly to the goal of the ...
Publication Info
- Year
- 1999
- Type
- article
- Volume
- 36
- Issue
- 1-2
- Pages
- 105-139
- Citations
- 2607
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2607
OpenAlex
Cite This
Eric Bauer,
Ron Kohavi
(1999).
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants.
Machine Learning
, 36
(1-2)
, 105-139.
https://doi.org/10.1023/a:1007515423169
Identifiers
- DOI
- 10.1023/a:1007515423169