{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T11:29:48Z","timestamp":1777548588895,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407201","type":"print"},{"value":"9783540451679","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_20","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:10:53Z","timestamp":1279825853000},"page":"258-272","source":"Crossref","is-referenced-by-count":15,"title":["Robust Regression by Boosting the Median"],"prefix":"10.1007","author":[{"given":"Bal\u00e1zs","family":"K\u00e9gl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"491","volume":"11","author":"R. Avnimelech","year":"1999","unstructured":"Avnimelech, R., Intrator, N.: Boosting regression estimators. Neural Computation\u00a011, 491\u2013513 (1999)","journal-title":"Neural Computation"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bertoni, A., Campadelli, P., Parodi, M.: A boosting algorithm for regression. In: Proceedings of the Int. Conf. on Artificial Neural Networks, pp. 343\u2013348 (1997)","DOI":"10.1007\/BFb0020178"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"B\u00fchlmann, P.: Bagging, subagging and bragging for improving some prediction algorithms. In: Akritas, M.G., Politis, D.N. (eds.) Recent Advances and Trends in Nonparametric Statistics (2003) (to appear)","DOI":"10.1016\/B978-044451378-6\/50002-8"},{"key":"20_CR4","unstructured":"Drucker, H.: Improving regressors using boosting techniques. In: Proceedings of the 14th International Conference on Machine Learning, pp. 107\u2013115 (1997)"},{"key":"20_CR5","unstructured":"Duffy, N., Helmbold, D.P.: Leveraging for regression. In: Proceedings of the 13th Conference on Computational Learning Theory, pp. 208\u2013219 (2000)"},{"issue":"2","key":"20_CR6","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y.: Boosting a weak learning algorithm by majority. Information and Computation\u00a0121(2), 256\u2013285 (1995)","journal-title":"Information and Computation"},{"issue":"1","key":"20_CR7","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(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR8","unstructured":"Friedman, J.: Greedy function approximation: a gradient boosting machine. Technical report, Dept. of Statistics, Stanford University (1999)"},{"key":"20_CR9","first-page":"512","volume-title":"NIPS 1999","author":"L. Mason","year":"2000","unstructured":"Mason, L., Bartlett, P., Baxter, J., Frean, M.: Boosting algorithms as gradient descent. In: NIPS 1999, vol.\u00a012, pp. 512\u2013518. The MIT Press, Cambridge (2000)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"R\u00e4tsch, G., Warmuth, M.K.: Marginal boosting. In: Proceedings of the 15th Conference on Computational Learning Theory (2002)","DOI":"10.1007\/3-540-45435-7_23"},{"key":"20_CR11","unstructured":"R\u00e4tsch, G., Warmuth, M.K.: Efficient margin maximizing with boosting. Journal of Machine Learning Research (2003) (submitted)"},{"issue":"5","key":"20_CR12","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. Annals of Statistics\u00a026(5), 1651\u20131686 (1998)","journal-title":"Annals of Statistics"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"R.E. Schapire","year":"1999","unstructured":"Schapire, R.E., Singer, Y.: Improved boosting algorithms using confidence-rated predictions. Machine Learning\u00a037(3), 297\u2013336 (1999)","journal-title":"Machine Learning"},{"key":"20_CR14","unstructured":"Zemel, R.S., Pitassi, T.: A gradient-based boosting algorithm for regression problems. In: NIPS 2000, vol.\u00a013, pp. 696\u2013702 (2001)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T03:30:35Z","timestamp":1552793435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}