{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T03:25:29Z","timestamp":1775705129883,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1023\/a:1013912006537","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T13:55:48Z","timestamp":1041083748000},"page":"253-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":401,"title":["Logistic Regression, AdaBoost and Bregman Distances"],"prefix":"10.1007","volume":"48","author":[{"given":"Michael","family":"Collins","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Schapire","sequence":"additional","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"393398_CR1","first-page":"39","volume":"22","author":"A. L. Berger","year":"1996","unstructured":"Berger, A. L., Pietra, S. A. D., & Pietra, V. J. D. (1996). A maximum entropy approach to natural language processing. Computational Linguistics, 22:1, 39\u201371.","journal-title":"Computational Linguistics"},{"issue":"1","key":"393398_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0041-5553(67)90040-7","volume":"7","author":"L. M. Bregman","year":"1967","unstructured":"Bregman, L. M. (1967). The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. U.S.S.R. Computational Mathematics and Mathematical Physics, 7:1, 200\u2013217.","journal-title":"U.S.S.R. Computational Mathematics and Mathematical Physics"},{"key":"393398_CR3","unstructured":"Breiman, L. (1997a). Arcing the edge. Technical Report 486, Statistics Department, University of California at Berkeley."},{"issue":"7","key":"393398_CR4","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L. Breiman","year":"1999","unstructured":"Breiman, L. (1999). Prediction games and arcing classifiers. Neural Computation, 11:7, 1493\u20131517.","journal-title":"Neural Computation"},{"issue":"3","key":"393398_CR5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF00934676","volume":"34","author":"Y. Censor","year":"1981","unstructured":"Censor, Y., & Lent, A. (1981). An iterative row-action method for interval convex programming. Journal of Optimization Theory and Applications, 34:3, 321\u2013353.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"393398_CR6","volume-title":"Parallel optimization: Theory, algorithms, and applications","author":"Y. Censor","year":"1997","unstructured":"Censor, Y., & Zenios, S. A. (1997). Parallel optimization: Theory, algorithms, and applications. Oxford: Oxford University Press."},{"issue":"4","key":"393398_CR7","doi-asserted-by":"crossref","first-page":"1215","DOI":"10.1109\/18.335953","volume":"40","author":"N. Cesa-Bianchi","year":"1994","unstructured":"Cesa-Bianchi, N., Krogh, A., & Warmuth, M. K. (1994). Bounds on approximate steepest descent for likelihood maximization in exponential families. IEEE Transactions on Information Theory, 40:4, 1215\u20131220.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"393398_CR8","first-page":"2032","volume":"19","author":"W. W. Cohen","year":"1999","unstructured":"Cohen, W. W., & Singer, Y. (1999). A simple, fast, and effective rule learner. In Proceedings of the Sixteenth National Conference on Artificial Intelligence. Csisz\u00e1r, I. (1991). Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems. The Annals of Statistics, 19:4, 2032\u20132066.","journal-title":"The Annals of Statistics"},{"issue":"12","key":"393398_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01874442","volume":"68","author":"I. Csisz\u00e1r","year":"1995","unstructured":"Csisz\u00e1r, I. (1995). Generalized projections for non-negative functions. Acta Mathematica Hungarica, 68:12, 161\u2013185.","journal-title":"Acta Mathematica Hungarica"},{"issue":"5","key":"393398_CR10","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1214\/aoms\/1177692379","volume":"43","author":"J. N. Darroch","year":"1972","unstructured":"Darroch, J. N., & Ratcliff, D. (1972). Generalized iterative scaling for log-linear models. The Annals of Mathematical Statistics, 43:5, 1470\u20131480.","journal-title":"The Annals of Mathematical Statistics"},{"issue":"4","key":"393398_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/34.588021","volume":"19","author":"S. Della Pietra","year":"1997","unstructured":"Della Pietra, S., Della Pietra, V., & Lafferty, J. (1997). Inducing features of random fields. IEEE Transactions Pattern Analysis and Machine Intelligence, 19:4, 1\u201313.","journal-title":"IEEE Transactions Pattern Analysis and Machine Intelligence"},{"key":"393398_CR12","unstructured":"Della Pietra, S., Della Pietra, V., & Lafferty, J. (2001). Duality and auxiliary functions for Bregman distances. Technical Report CMU-CS-01-109, School of Computer Science, Carnegie Mellon University."},{"key":"393398_CR13","doi-asserted-by":"crossref","unstructured":"Domingo, C., & Watanabe, O. (2000). Scaling up a boosting-based learner via adaptive sampling. In Proceedings of the Fourth Pacific-Asia Conference on Knowledge Discovery and Data Mining.","DOI":"10.1007\/3-540-45571-X_37"},{"key":"393398_CR14","unstructured":"Duffy, N., & Helmbold, D. (1999). Potential boosters? In Advances in neural information processing systems 11."},{"key":"393398_CR15","unstructured":"Freund, Y., & Mason, L. (1999). The alternating decision tree learning algorithm. In Machine Learning: Proceedings of the Sixteenth International Conference (pp. 124-133)."},{"issue":"1","key":"393398_CR16","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55:1, 119\u2013139.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"393398_CR17","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"38","author":"J. Friedman","year":"2000","unstructured":"Friedman, J., Hastie, T., & Tibshirani, R. (2000). Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 38:2, 337\u2013374.","journal-title":"The Annals of Statistics"},{"key":"393398_CR18","doi-asserted-by":"crossref","unstructured":"H\u00f6ffgen, K.-U., & Simon, H.-U. (1992). Robust trainability of single neurons. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (pp. 428-439.)","DOI":"10.1145\/130385.130431"},{"issue":"1","key":"393398_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., & Warmuth, M. K. (1997). Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132:1, 1\u201364.","journal-title":"Information and Computation"},{"key":"393398_CR20","doi-asserted-by":"crossref","unstructured":"Kivinen, J., & Warmuth, M. K. (1999). Boosting as entropy projection. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory (pp. 134-144).","DOI":"10.1145\/307400.307424"},{"issue":"3","key":"393398_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J. Kivinen","year":"2001","unstructured":"Kivinen, J., & Warmuth, M. K. (2001). Relative loss bounds for multidimensional regression problems. Machine Learning, 45:3, 301\u2013329.","journal-title":"Machine Learning"},{"key":"393398_CR22","doi-asserted-by":"crossref","unstructured":"Lafferty, J. (1999). Additive models, boosting and inference for generalized divergences. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory (pp. 125-133).","DOI":"10.1145\/307400.307422"},{"key":"393398_CR23","unstructured":"Lafferty, J. D., Pietra, S. D., & Pietra, V. D. (1997). Statistical learning algorithms based on Bregman distances. In Proceedings of the Canadian Workshop on Information Theory."},{"issue":"1","key":"393398_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01277953","volume":"5","author":"N. Littlestone","year":"1995","unstructured":"Littlestone, N., Long, P. M., & Warmuth, M. K. (1995). On-line learning of linear functions. Computational Complexity, 5:1, 1\u201323.","journal-title":"Computational Complexity"},{"key":"393398_CR25","volume-title":"Advances in large margin classifiers","author":"L. Mason","year":"1999","unstructured":"Mason, L., Baxter, J., Bartlett, P., & Frean, M. (1999). Functional gradient techniques for combining hypotheses. In A. J. Smola, P. J. Bartlett, B. Sch\u00f6lkopf, & D. Schuurmans (Eds.), Advances in large margin classifiers. Cambridge, MA: MIT Press."},{"issue":"3","key":"393398_CR26","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G., Onoda, T., & M\u00fcller, K.-R. (2001). Soft margins for AdaBoost. Machine Learning, 42:3, 287\u2013320.","journal-title":"Machine Learning"},{"issue":"3","key":"393398_CR27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R. E. Schapire","year":"1999","unstructured":"Schapire, R. E., & Singer, Y. (1999). Improved boosting algorithms using confidence-rated predictions. Machine Learning, 37:3, 297\u2013336.","journal-title":"Machine Learning"},{"issue":"2\/3","key":"393398_CR28","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/A:1007649029923","volume":"39","author":"R. E. Schapire","year":"2000","unstructured":"Schapire, R. E., & Singer, Y. (2000). BoosTexter: A boosting-based system for text categorization. Machine Learning, 39:2\/3, 135\u2013168.","journal-title":"Machine Learning"},{"key":"393398_CR29","doi-asserted-by":"crossref","unstructured":"Watanabe, O. (1999). From computational learning theory to discovery science. In Proceedings of the 26th International Colloquium on Automata, Languages and Programming (pp. 134-148).","DOI":"10.1007\/3-540-48523-6_11"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013912006537.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013912006537\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013912006537.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:46:30Z","timestamp":1752147990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013912006537"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":29,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["393398"],"URL":"https:\/\/doi.org\/10.1023\/a:1013912006537","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,7]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}