The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression
Abstract
The application of boosting technique to regression problems has received relatively little attention in contrast to research aimed at classification problems. This letter describes a new boosting algorithm, AdaBoost.RT, for regression problems. Its idea is in filtering out the examples with the relative estimation error that is higher than the preset threshold value, and then following the AdaBoost procedure. Thus, it requires selecting the suboptimal value of the error threshold to demarcate examples as poorly or well predicted. Some experimental results using the M5 model tree as a weak learning machine for several benchmark data sets are reported. The results are compared to other boosting methods, bagging, artificial neural networks, and a single M5 model tree. The preliminary empirical comparisons show higher performance of AdaBoost.RT for most of the considered data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Popular Ensemble Methods: An Empirical Study
Opitz, D., & Maclin, R. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.614 · Cited by 2,953
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Cited by
Data-driven modelling: some past experiences and new approaches
Solomatine, D. P., & Ostfeld, A. (2008) · Journal of Hydroinformatics · doi:10.2166/hydro.2008.015 · Cited by 723
Self-citationGenomic Selection in Plant Breeding: A Comparison of Models
Heslot, N., Yang, H., Sorrells, M. E., & Jannink, J. (2012) · Crop Science · doi:10.2135/cropsci2011.06.0297 · Cited by 698
Ren, Y., Zhang, L., & Suganthan, P. N. (2016) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2015.2471235 · Cited by 675
Ensemble approaches for regression: A survey
Mendes-Moreira, J., Soares, C., Jorge, A. M., & Sousa, J. F. D. (2012) · ACM Computing Surveys · doi:10.1145/2379776.2379786 · Cited by 667
Ensemble methods for wind and solar power forecasting—A state-of-the-art review
Ren, Y., Suganthan, P. N., & Srikanth, N. (2015) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2015.04.081 · Cited by 435
Metadata
- Authors
- Shrestha, D. L., & Solomatine, D. P.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2006-07
- Volume
- 18
- Issue
- 7
- Pages
- 1678-1710
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2121043290
- Cited by
- 233
- References
- 8
- FWCI
- 6.89
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression. https://app.cochat.ai/papers/10.1162/neco.2006.18.7.1678
- The paper
- Shrestha, D. L., & Solomatine, D. P. (2006). Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression. Neural Computation. https://doi.org/10.1162/neco.2006.18.7.1678
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.