{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:19:11Z","timestamp":1778249951248,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540239314","type":"print"},{"value":"9783540304999","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30499-9_76","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T09:41:13Z","timestamp":1277890873000},"page":"496-501","source":"Crossref","is-referenced-by-count":12,"title":["The Most Robust Loss Function for Boosting"],"prefix":"10.1007","author":[{"given":"Takafumi","family":"Kanamori","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Takenouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinto","family":"Eguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noboru","family":"Murata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"76_CR1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1111\/j.2517-6161.1988.tb01723.x","volume":"50","author":"J. Copas","year":"1988","unstructured":"Copas, J.: Binary regression models for contaminated data. J. Royal Statist. Soc. B\u00a050, 225\u2013265 (1988)","journal-title":"J. Royal Statist. Soc. B"},{"key":"76_CR2","unstructured":"Domingo, C., Watanabe, O.: MadaBoost: A modification of AdaBoost. In: Proc. of the 13th Conference on Computational Learning Theory, COLT (2000)"},{"key":"76_CR3","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 on-line learning and an application to boosting. Journal of Computer and System Sciences\u00a055, 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"76_CR4","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J.H. Friedman","year":"2000","unstructured":"Friedman, J.H., Hastie, T., Tibshirani, R.: Additive logistic regression: A statistical view of boosting. Annals of Statistics\u00a028, 337\u2013407 (2000)","journal-title":"Annals of Statistics"},{"key":"76_CR5","unstructured":"Hampel, F.R., Rousseeuw, P.J., Ronchetti, E.M., Stahel, W.A.: Robust statistics. the approach based on influence functions. John Wiley and Sons, Inc., Chichester (1986)"},{"key":"76_CR6","doi-asserted-by":"crossref","unstructured":"Lebanon, G., Lafferty, J.: Boosting and maximum likelihood for exponential models. Advances in Neural Information Processing Systems (2002)","DOI":"10.7551\/mitpress\/1120.003.0062"},{"key":"76_CR7","unstructured":"Mason, L., Baxter, J., Bartlett, P.L., Frean, M.: Boosting algorithms as gradient descent. Advances in Neural Information Processing Systems (1999)"},{"key":"76_CR8","doi-asserted-by":"crossref","unstructured":"Murata, N., Takenouchi, T., Kanamori, T., Eguchi, S.: Information geometry of u-boost and bregman divergence. Neural Computation (2004) (To appear)","DOI":"10.1162\/089976604323057452"},{"key":"76_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e1tsch","year":"2001","unstructured":"R\u00e1tsch, G., Onoda, T., M\u00fcller, K.-R.: Soft margins for adaboost. Machine Learning\u00a042, 287\u2013320 (2001)","journal-title":"Machine Learning"},{"issue":"4","key":"76_CR10","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1162\/089976604322860695","volume":"16","author":"T. Takenouchi","year":"2004","unstructured":"Takenouchi, T., Eguchi, S.: Robustifying adaboost by adding the na\u00efve error rate. Neural Computation\u00a016(4), 767\u2013787 (2004)","journal-title":"Neural Computation"},{"key":"76_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2440-0","volume-title":"The Nature of Statistical Learning Theory","author":"V. Vapnik","year":"1995","unstructured":"Vapnik, V.: The Nature of Statistical Learning Theory. Springer, NY (1995)"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30499-9_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:09:05Z","timestamp":1778249345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30499-9_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540239314","9783540304999"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30499-9_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}