The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Boosting: An Ensemble Learning Tool for Compound Classification and QSAR Modeling
Abstract
A classification and regression tool, J. H. Friedman's Stochastic Gradient Boosting (SGB), is applied to predicting a compound's quantitative or categorical biological activity based on a quantitative description of the compound's molecular structure. Stochastic Gradient Boosting is a procedure for building a sequence of models, for instance regression trees (as in this paper), whose outputs are combined to form a predicted quantity, either an estimate of the biological activity, or a class label to which a molecule belongs. In particular, the SGB procedure builds a model in a stage-wise manner by fitting each tree to the gradient of a loss function: e.g., squared error for regression and binomial log-likelihood for classification. The values of the gradient are computed for each sample in the training set, but only a random sample of these gradients is used at each stage. (Friedman showed that the well-known boosting algorithm, AdaBoost of Freund and Schapire, could be considered as a particular case of SGB.) The SGB method is used to analyze 10 cheminformatics data sets, most of which are publicly available. The results show that SGB's performance is comparable to that of Random Forest, another ensemble learning method, and are generally competitive with or superior to those of other QSAR methods. The use of SGB's variable importance with partial dependence plots for model interpretation is also illustrated.
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
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
Cited by
Deep Neural Nets as a Method for Quantitative Structure–Activity Relationships
Ma, J., Sheridan, R. P., Liaw, A., Dahl, G. E., & Svetnik, V. (2015) · Journal of Chemical Information and Modeling · doi:10.1021/ci500747n · Cited by 1,159
Self-citationMuratov, E. N., Bajorath, J., Sheridan, R. P., Tetko, I. V., Filimonov, D., Poroikov, V., Oprea, T. I., Baskin, I. I., Varnek, A., Roitberg, A., et al. (2020) · Chemical Society Reviews · doi:10.1039/d0cs00098a · Cited by 913
Self-citationMining data with random forests: A survey and results of new tests
Verikas, A., Gelzinis, A., & Bacauskiene, M. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.08.011 · Cited by 719
Extreme Gradient Boosting as a Method for Quantitative Structure–Activity Relationships
Sheridan, R. P., Wang, W. M., Liaw, A., Ma, J., & Gifford, E. M. (2016) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.6b00591 · Cited by 544
Self-citationHe, T., Heidemeyer, M., Ban, F., Cherkasov, A., & Ester, M. (2017) · Journal of Cheminformatics · doi:10.1186/s13321-017-0209-z · Cited by 509
Metadata
- Authors
- Svetnik, V., Wang, T., Tong, C., Liaw, A., Sheridan, R. P., & Song, Q.
- Venue
- Journal of Chemical Information and Modeling
- Publisher
- American Chemical Society (ACS)
- Published
- 2005-04-20
- Volume
- 45
- Issue
- 3
- Pages
- 786-799
- ISSN
- 1549-9596 (ISSN-L)
- 1549-960X
- OpenAlex
- W1977405994
- Cited by
- 218
- References
- 2
- FWCI
- 6.59
- 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: Boosting: An Ensemble Learning Tool for Compound Classification and QSAR Modeling. https://app.cochat.ai/papers/10.1021/ci0500379
- The paper
- Svetnik, V., Wang, T., Tong, C., Liaw, A., Sheridan, R. P., & Song, Q. (2005). Boosting: An Ensemble Learning Tool for Compound Classification and QSAR Modeling. Journal of Chemical Information and Modeling. https://doi.org/10.1021/ci0500379
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.