ada: An R Package for Stochastic Boosting
Open accessThe DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
Boosting is an iterative algorithm that combines simple classification rules with "mediocre" performance in terms of misclassification error rate to produce a highly accurate classification rule. Stochastic gradient boosting provides an enhancement which incorporates a random mechanism at each boosting step showing an improvement in performance and speed in generating the ensemble. ada is an R package that implements three popular variants of boosting, together with a version of stochastic gradient boosting. In addition, useful plots for data analytic purposes are provided along with an extension to the multi-class case. The algorithms are illustrated with synthetic and real data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Classification And Regression Trees
Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (2017) · doi:10.1201/9781315139470 · Cited by 11,417
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 5×
“[11] established connections of the AdaBoost.”
InfluentialThe Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Bagging and Boosting Classification Trees to Predict Churn
Lemmens, A., & Croux, C. (2006) · Journal of Marketing Research · doi:10.1509/jmkr.43.2.276 · Cited by 411 · cited 1×
“In addition to pharmacology, boosting algorithms have encompassed a wide range of applications including tumor identification and gene expression data [7], proteomics data [24], financial and marketing data [2; 18], fisheries data [17], and microscope imaging data [15].”
Cited by
Building Predictive Models in R Using the caret Package
Kuhn, M. (2008) · Journal of Statistical Software · doi:10.18637/jss.v028.i05 · Cited by 8,863
Evaluating multiple classifiers for stock price direction prediction
Ballings, M., Van den Poel, D., Hespeels, N., & Gryp, R. (2015) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.05.013 · Cited by 611
deFuse: An Algorithm for Gene Fusion Discovery in Tumor RNA-Seq Data
McPherson, A., Hormozdiari, F., Zayed, A., Giuliany, R., Ha, G., Sun, M. G. F., Griffith, M., Heravi Moussavi, A., Senz, J., Melnyk, N., et al. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1001138 · Cited by 557
“0) to train an adaboost model using the stochastic gradient boosting algorithm with exponential loss, discrete boosting, and decision stumps as the base classifier [20].”
In silico prediction of splice-altering single nucleotide variants in the human genome
Jian, X., Boerwinkle, E., & Liu, X. (2014) · Nucleic Acids Research · doi:10.1093/nar/gku1206 · Cited by 537
Bridging the gap between physical location and online social networks
Cranshaw, J., Toch, E., Hong, J., Kittur, A., & Sadeh, N. (2010) · Proceedings of the 12th ACM international conference on Ubiquitous computing · doi:10.1145/1864349.1864380 · Cited by 431
Metadata
- Authors
- Culp, M., Johnson, K., & Michailidis, G.
- Venue
- Journal of Statistical Software
- Publisher
- Foundation for Open Access Statistic
- Published
- 2006
- Volume
- 17
- Issue
- 2
- ISSN
- 1548-7660 (ISSN-L)
- OpenAlex
- W1799405941
- Cited by
- 100
- References
- 6
- FWCI
- 3.06
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.