The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Logistic Regression, AdaBoost and Bregman Distances
Open accessOverview
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
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
Self-citationFriedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884 · cited 1×
“Given this assumption, it has been noted by Breiman (1997a, 1997b) and various later authors (Friedman et al., 2000; Mason et al., 1999; Rätsch, Onoda, & Müller, 2001; Schapire & Singer, 1999) that the choice of both hj and are done in such a way as to cause the greatest decrease in the exponential loss induced by , g…”
BackgroundA maximum entropy approach to natural language processing
Berger, A. L., Pietra, V. J. D., & Pietra, S. A. D. (1996) · doi:10.5555/234285.234289 · Cited by 3,065
Bregman, L. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90040-7 · Cited by 2,618
Improved boosting algorithms using confidence-rated predictions
Schapire, R. E., & Singer, Y. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279960 · Cited by 2,547
Self-citationBoosTexter: A Boosting-based System for Text Categorization
Schapire, R. E., & Singer, Y. (2000) · Machine Learning · doi:10.1023/a:1007649029923 · Cited by 2,188
Self-citationImproved Boosting Algorithms Using Confidence-rated Predictions
Schapire, R. E., & Singer, Y. (1999) · Machine Learning · doi:10.1023/a:1007614523901 · Cited by 1,971
Self-citation$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Rätsch, G., Onoda, T., & Müller, K.-R. (2001) · Machine Learning · doi:10.1023/a:1007618119488 · Cited by 1,299
Generalized Iterative Scaling for Log-Linear Models
Darroch, J. N., & Ratcliff, D. (1972) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177692379 · Cited by 1,206
Cited by
Strictly Proper Scoring Rules, Prediction, and Estimation
Gneiting, T., & Raftery, A. E. (2007) · Journal of the American Statistical Association · doi:10.1198/016214506000001437 · Cited by 5,793
A maximum entropy approach to species distribution modeling
Phillips, S. J., Dudík, M., & Schapire, R. E. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015412 · Cited by 2,252
Self-citationThe Boosting Approach to Machine Learning: An Overview
Schapire, R. E. (2003) · Lecture Notes in Statistics · doi:10.1007/978-0-387-21579-2_9 · Cited by 2,003
Self-citationFoundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Boosting With the L2Loss: Regression and Classification
Bühlmann, P., & Yu, B. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503000125 · Cited by 845
Putting Objects in Perspective
Hoiem, D., Efros, A. A., & Hebert, M. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-008-0137-5 · Cited by 805
Schneider, A., Friedl, M. A., & Potere, D. (2010) · Remote Sensing of Environment · doi:10.1016/j.rse.2010.03.003 · Cited by 726
Discriminative Reranking for Natural Language Parsing
Collins, M., & Koo, T. (2005) · Computational Linguistics · doi:10.1162/0891201053630273 · Cited by 710
Self-citationRecovering Surface Layout from an Image
Hoiem, D., Efros, A. A., & Hebert, M. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-0031-y · Cited by 674
Geometric context from a single image
Hoiem, D., Efros, A. A., & Hebert, M. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.107 · Cited by 662
Hoiem, D., Efros, A. A., & Hebert, M. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073232 · Cited by 616
A Tour of Modern Image Filtering: New Insights and Methods, Both Practical and Theoretical
Milanfar, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2011.2179329 · Cited by 605
Advance and Prospects of AdaBoost Algorithm
CAO, Y., MIAO, Q.-G., LIU, J.-C., & GAO, L. (2013) · Acta Automatica Sinica · doi:10.1016/s1874-1029(13)60052-x · Cited by 512
RA-UNet: A Hybrid Deep Attention-Aware Network to Extract Liver and Tumor in CT Scans
Jin, Q., Meng, Z., Sun, C., Cui, H., & Su, R. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.605132 · Cited by 468
An Introduction to Boosting and Leveraging
Meir, R., & Rätsch, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_4 · Cited by 447
Schneider, A. (2012) · Remote Sensing of Environment · doi:10.1016/j.rse.2012.06.006 · Cited by 443
Theory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
One trillion edges: graph processing at Facebook-scale
Ching, A., Edunov, S., Kabiljo, M., Logothetis, D., & Muthukrishnan, S. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2824032.2824077 · Cited by 404
ACAS: automated construction of application signatures
Haffner, P., Sen, S., Spatscheck, O., & Wang, D. (2005) · Proceeding of the 2005 ACM SIGCOMM workshop on Mining network data - MineNet '05 · doi:10.1145/1080173.1080183 · Cited by 375
Logistic regression in data analysis: an overview
Maalouf, M. (2011) · International Journal of Data Analysis Techniques and Strategies · doi:10.1504/ijdats.2011.041335 · Cited by 347
Zafeiriou, S., Tefas, A., Buciu, I., & Pitas, I. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.873291 · Cited by 329
A Convergent Incremental Gradient Method with a Constant Step Size
Blatt, D., Hero, A. O., & Gauchman, H. (2007) · SIAM Journal on Optimization · doi:10.1137/040615961 · Cited by 306
Multiple Classifier System for Remote Sensing Image Classification: A Review
Du, P., Xia, J., Zhang, W., Tan, K., Liu, Y., & Liu, S. (2012) · Sensors · doi:10.3390/s120404764 · Cited by 299
Boosting Algorithms: A Review of Methods, Theory, and Applications
Ferreira, A. J., & Figueiredo, M. A. T. (2012) · Ensemble Machine Learning · doi:10.1007/978-1-4419-9326-7_2 · Cited by 295
Boosting with early stopping: Convergence and consistency
Zhang, T., & Yu, B. (2005) · The Annals of Statistics · doi:10.1214/009053605000000255 · Cited by 281
A review on the combination of binary classifiers in multiclass problems
Lorena, A. C., de Carvalho, A. C. P. L. F., & Gama, J. M. P. (2008) · Artificial Intelligence Review · doi:10.1007/s10462-009-9114-9 · Cited by 270
Putting Objects in Perspective
Hoiem, D., Efros, A. A., & Hebert, M. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.232 · Cited by 258
Recovering Occlusion Boundaries from a Single Image
Hoiem, D., Stein, A. N., Efros, A. A., & Hebert, M. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408985 · Cited by 206
“We estimate the unary ( P( e 1 | data) ) and conditional ( P( e 1 | e 2 , data) ) boundary classifiers using a logistic regression version of Adaboost [5], with 20 16-node decision trees as weak learners.”
MethodEstimating residential energy consumption in metropolitan areas: A microsimulation approach
Zhang, W., Robinson, C., Guhathakurta, S., Garikapati, V. M., Dilkina, B., Brown, M. A., & Pendyala, R. M. (2018) · Energy · doi:10.1016/j.energy.2018.04.161 · Cited by 68
“In contrast, ensemble learning models, such as Bagging, Random Forest, Gradient Boosting, AdaBoost, and Extra Trees, perform comparatively poorly, with higher absolute errors and lower R2 values.”
MethodInfluential
Metadata
- Authors
- Collins, M., Schapire, R. E., & Singer, Y.
- Venue
- Machine Learning
- Published
- 2002-07
- Volume
- 48
- Issue
- 1-3
- Pages
- 253-285
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1546961578
- Cited by
- 687
- References
- 33
- FWCI
- 27.43
- Type
- journal article
- Language
- en
- Open access
- bronze
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.