{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:19:26Z","timestamp":1725563966716},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642161070"},{"type":"electronic","value":"9783642161087"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16108-7_9","type":"book-chapter","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T12:58:37Z","timestamp":1283259517000},"page":"59-73","source":"Crossref","is-referenced-by-count":2,"title":["Approximation Stability and Boosting"],"prefix":"10.1007","author":[{"given":"Wei","family":"Gao","sequence":"first","affiliation":[]},{"given":"Zhi-Hua","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/263867.263927","volume":"44","author":"N. Alon","year":"1997","unstructured":"Alon, N., Ben-David, S., Cesa-Bianchi, N., Haussler, D.: Scale-sensitive dimensions, uniform convergence, and learnablity. J. ACM\u00a044(4), 615\u2013631 (1997)","journal-title":"J. ACM"},{"key":"9_CR2","first-page":"705","volume":"7","author":"J.P. Bickel","year":"2006","unstructured":"Bickel, J.P., Ritov, Y., Zakai, A.: Some theory for generalized boosting algorithms. J. Mach. Learn. Res.\u00a07, 705\u2013732 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1162\/153244302760200704","volume":"2","author":"O. Bousquet","year":"2002","unstructured":"Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res.\u00a02, 499\u2013526 (2002)","journal-title":"J. Mach. Learn. Res."},{"issue":"7","key":"9_CR4","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 classifiers. Neural Comput.\u00a011(7), 1493\u20131517 (1999)","journal-title":"Neural Comput."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TIT.1979.1056087","volume":"25","author":"L.P. Devroye","year":"1979","unstructured":"Devroye, L.P., Wagner, T.J.: Distribution-free performance bounds for potential function rules. IEEE Trans. Inform. Theory\u00a025, 601\u2013604 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R.E.: Game theory, on-line prediction and boosting. In: Proc. of 9th COLT, Desenzano sul Garda, Italy, pp. 325\u2013332 (1996)","DOI":"10.1145\/238061.238163"},{"issue":"1","key":"9_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. J. Comput. Syst. Sci.\u00a055(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR8","first-page":"171","volume":"9","author":"Y. Freund","year":"2008","unstructured":"Freund, Y., Schapire, R.E.: Response to \u201cEvidence contrary to the statistical view of Boosting\u201d. J. Mach. Learn. Res.\u00a09, 171\u2013174 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J. Friedman","year":"2000","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Addtive logistic regression: A statistical view of boosting (with discussion). Ann. Statist.\u00a028, 337\u2013407 (2000)","journal-title":"Ann. Statist."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1162\/089976699300016304","volume":"11","author":"M. Kearns","year":"1999","unstructured":"Kearns, M., Ron, D.: Algorithmic stability and sanity-check bounds for leave-one-out cross-validation. Neural Comput.\u00a011, 1427\u20131453 (1999)","journal-title":"Neural Comput."},{"key":"9_CR11","unstructured":"Kutin, S., Niyogi, P.: The interaction of stability and weakness in Adaboost. Technical Report\u00a030, Department of Computer Science, University of Chicago, Chicago, IL (2001)"},{"key":"9_CR12","unstructured":"Kutin, S., Niyogi, P.: Almost-everywhere algorithmic stability and generalization error. In: Proc. of 18th UAI, Edmonton, Canada, pp. 275\u2013282 (2002)"},{"key":"9_CR13","first-page":"512","volume-title":"Advances in NIPS","author":"L. Mason","year":"1999","unstructured":"Mason, L., Baxter, J., Bartlett, P.L., Freman, M.R.: Boosting algorithms as gradient descent. In: Solla, S.A., Leen, T.K., M\u00fcller, K.-R. (eds.) Advances in NIPS, vol.\u00a012, pp. 512\u2013518. MIT Press, Cambridge (1999)"},{"key":"9_CR14","first-page":"148","volume-title":"Surveys in Combinatorics","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics, pp. 148\u2013188. Cambridge University Press, Cambridge (1989)"},{"key":"9_CR15","first-page":"131","volume":"9","author":"D. Mease","year":"2008","unstructured":"Mease, D., Wyner, A.: Evidence contrary to the statistical view of boosting with discussion. J. Mach. Learn. Res.\u00a09, 131\u2013201 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10444-004-7634-z","volume":"25","author":"S. Mukherjee","year":"2006","unstructured":"Mukherjee, S., Niyogi, P., Poggio, T., Rifkin, R.: Learning theory: Stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimzation. Adv. Comput. Math.\u00a025, 161\u2013193 (2006)","journal-title":"Adv. Comput. Math."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1142\/S0219530505000650","volume":"4","author":"A. Rakhlin","year":"2005","unstructured":"Rakhlin, A., Mukherjee, S., Poggio, T.: Stability results in learning theory. Anal. Appl.\u00a04, 397\u2013417 (2005)","journal-title":"Anal. Appl."},{"key":"9_CR18","doi-asserted-by":"publisher","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.: Soft margins for Adaboost. Mach. Learn.\u00a042, 287\u2013320 (2001)","journal-title":"Mach. Learn."},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Reyzin, L., Schapire, R.E.: How boosting the margin can also boost classifier complexity. In: Proc. of 23rd ICML, Pittsburgh, PA, pp. 753\u2013760 (2006)","DOI":"10.1145\/1143844.1143939"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Rudin, C., Schapire, R.E., Daubechies, I.: Precise statements of convergence for adaboost and arc-gv. In: Proc. of AMS-IMS-SIAM Joint Summer Research Conference: Machine learning, Statistics and Discovery, Snowbird, Utah, pp. 131\u2013145 (2007)","DOI":"10.1090\/conm\/443\/08559"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. Schapire","year":"1998","unstructured":"Schapire, R., Freund, Y., Bartlett, P.L., Lee, W.: Boosting the margin: A new explanation for the effectives of voting methods. Ann. Statist.\u00a026, 1651\u20131686 (1998)","journal-title":"Ann. Statist."},{"key":"9_CR22","unstructured":"Shalev-Shwartz, S., Shamir, O., Srebro, N., Sridharan, K.: Learnability and stability in the general learning setting. In: Proc. of 22nd COLT, Montreal, Canada (2009)"},{"key":"9_CR23","unstructured":"Shalev-Shwartz, S., Shamir, O., Srebro, N., Sridharan, K.: Stochastic convex optimation. In: Proc. of 22nd COLT, Montreal, Canada (2009)"},{"key":"9_CR24","volume-title":"Statistical Learning Theory","author":"V.N. Vapnik","year":"1998","unstructured":"Vapnik, V.N.: Statistical Learning Theory. John Wiley & Sons, New York (1998)"},{"key":"9_CR25","unstructured":"Wang, L., Sugiyama, M., Yang, C., Zhou, Z.-H., Feng, J.: On the margin explanation of boosting algorithm. In: Proc. of 21st COLT, Helsinki, Finland, pp. 479\u2013490 (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16108-7_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:22:23Z","timestamp":1619785343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16108-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642161070","9783642161087"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16108-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}