{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:09:21Z","timestamp":1742800161605},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222828"},{"type":"electronic","value":"9783540278191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27819-1_35","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T06:05:39Z","timestamp":1284444339000},"page":"502-517","source":"Crossref","is-referenced-by-count":9,"title":["Boosting Based on a Smooth Margin"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Rudin","sequence":"first","affiliation":[]},{"given":"Robert E.","family":"Schapire","sequence":"additional","affiliation":[]},{"given":"Ingrid","family":"Daubechies","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","unstructured":"Breiman, L.: Arcing the edge. Technical Report 486, Statistics Department, University of California at Berkeley (1997)"},{"issue":"7","key":"35_CR2","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L. Breiman","year":"1999","unstructured":"Breiman, L.: Prediction games and arcing algorithms. Neural Computation\u00a011(7), 1493\u20131517 (1999)","journal-title":"Neural Computation"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Collins, M., Schapire, R.E., Singer, Y.: Logistic regression, AdaBoost and Bregman distances. Machine Learning\u00a048(1\/2\/3) (2002)","DOI":"10.1023\/A:1013912006537"},{"issue":"1","key":"35_CR4","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of online learning and an application to boosting. Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR5","unstructured":"Grove, A.J., Schuurmans, D.: Boosting in the limit: Maximizing the margin of learned ensembles. In: Proceedings of the Fifteenth National Conference on Artificial Intelligence (1998)"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Koltchinskii, V., Panchenko, D.: Empirical margin distributions and bounding the generalization error of combined classifiers. The Annals of Statistics\u00a030(1) (February 2002)","DOI":"10.1214\/aos\/1015362183"},{"key":"35_CR7","unstructured":"Mason, L., Bartlett, P., Baxter, J.: Direct optimization of margins improves generalization in combined classifiers. Advances in Neural Information Processing Systems 12 (2000)"},{"key":"35_CR8","first-page":"119","volume-title":"Advanced Lectures on Machine Learning","author":"R. Meir","year":"2003","unstructured":"Meir, R., R\u00e4tsch, G.: An introduction to boosting and leveraging. In: Mendelson, S., Smola, A. (eds.) Advanced Lectures on Machine Learning, pp. 119\u2013184. Springer, Heidelberg (2003)"},{"key":"35_CR9","unstructured":"R\u00e4tsch, G., Warmuth, M.: Efficient margin maximizing with boosting ( 2002) (submitted)"},{"key":"35_CR10","unstructured":"Rosset, S., Zhu, J., Hastie, T.: Boosting as a regularized path to a maximum margin classifier. Technical report, Department of Statistics, Stanford University (2003)"},{"key":"35_CR11","unstructured":"Rudin, C., Daubechies, I., Schapire, R,E.:The dynamics of AdaBoost: Cyclic behavior and convergence of margins (2004) (submitted)"},{"key":"35_CR12","unstructured":"Rudin, C., Daubechies, I., Schapire, R.E.: On the dynamics of boosting. In: Advances in Neural Information Processing Systems 16 (2004)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Schapire, R.E.: The boosting approach to machine learning: An overview. In: MSRI Workshop on Nonlinear Estimation and Classification (2002)","DOI":"10.1007\/978-0-387-21579-2_9"},{"issue":"5","key":"35_CR14","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R.E. Schapire","year":"1998","unstructured":"Schapire, R.E., Freund, Y., Bartlett, P., Lee, W.S.: Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics\u00a026(5), 1651\u20131686 (1998)","journal-title":"The Annals of Statistics"},{"key":"35_CR15","unstructured":"Zhang, T., Yu, B.: Boosting with early stopping: convergence and consistency. Technical Report 635, Department of Statistics, UC Berkeley (2003)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27819-1_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:02Z","timestamp":1605759782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27819-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222828","9783540278191"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27819-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}