{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T04:36:18Z","timestamp":1747974978068,"version":"3.41.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319180373"},{"type":"electronic","value":"9783319180380"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18038-0_53","type":"book-chapter","created":{"date-parts":[[2015,4,16]],"date-time":"2015-04-16T06:46:36Z","timestamp":1429166796000},"page":"684-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Boosting via Approaching Optimal Margin Distribution"],"prefix":"10.1007","author":[{"given":"Chuan","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shizhong","family":"Liao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,17]]},"reference":[{"issue":"6","key":"53_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Occam\u2019s razor. Information Processing Letters 24(6), 377\u2013380 (1987)","journal-title":"Information Processing Letters"},{"issue":"7","key":"53_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 11(7), 1493\u20131517 (1999)","journal-title":"Neural Computation"},{"key":"53_CR3","unstructured":"B\u00fchlmann, P.L.: Consistency for L2Boosting and matching pursuit with trees and tree-type basis functions. Tech. Rep. 109, ETH Z\u00fcrich (2002)"},{"issue":"2","key":"53_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"TG Dietterich","year":"2000","unstructured":"Dietterich, T.G.: An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning 40(2), 139\u2013157 (2000)","journal-title":"Machine Learning"},{"key":"53_CR5","unstructured":"Freund, Y., Schapire, R.E.: Experiments with a new boosting algorithm. In: Proceedings of the 13th International Conference on Machine Learning, vol. 96, pp. 148\u2013156 (1996)"},{"issue":"1","key":"53_CR6","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 55(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"53_CR7","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.: Additive logistic regression: A statistical view of boosting. Annals of Statistics 28(2), 337\u2013407 (2000)","journal-title":"Annals of Statistics"},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2013.07.002","volume":"203","author":"W Gao","year":"2013","unstructured":"Gao, W., Zhou, Z.H.: On the doubt about margin explanation of boosting. Artificial Intelligence 203, 1\u201318 (2013)","journal-title":"Artificial Intelligence"},{"key":"53_CR9","unstructured":"Grove, A.J., Schuurmans, D.: Boosting in the limit: maximizing the margin of learned ensembles. In: Proceedings of the 15th National Conference on Artificial Intelligence, pp. 692\u2013699 (1998)"},{"issue":"1","key":"53_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1214\/aos\/1079120128","volume":"32","author":"W Jiang","year":"2004","unstructured":"Jiang, W.: Process consistency for Adaboost. Annals of Statistics 32(1), 13\u201329 (2004)","journal-title":"Annals of Statistics"},{"issue":"1","key":"53_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1015362183","volume":"30","author":"V Koltchinskii","year":"2002","unstructured":"Koltchinskii, V., Panchenko, D.: Empirical margin distributions and bounding the generalization error of combined classifiers. Annals of Statistics 30(1), 1\u201350 (2002)","journal-title":"Annals of Statistics"},{"issue":"4","key":"53_CR12","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1214\/009053605000000228","volume":"33","author":"V Koltchinskii","year":"2005","unstructured":"Koltchinskii, V., Panchenko, D.: Complexities of convex combinations and bounding the generalization error in classification. Annals of Statistics 33(4), 1455\u20131496 (2005)","journal-title":"Annals of Statistics"},{"key":"53_CR13","unstructured":"Mason, L., Baxter, J., Bartlett, P., Frean, M.: Boosting algorithms as gradient descent. In: Advances in Neural Information Processing Systems, pp. 512\u2013518 (1999)"},{"issue":"3","key":"53_CR14","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. Machine Learning 42(3), 287\u2013320 (2001)","journal-title":"Machine Learning"},{"key":"53_CR15","doi-asserted-by":"crossref","unstructured":"Reyzin, L., Schapire, R.E.: How boosting the margin can also boost classifier complexity. In: Proceedings of the 23rd International Conference on Machine learning, pp. 753\u2013760 (2006)","DOI":"10.1145\/1143844.1143939"},{"issue":"5","key":"53_CR16","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"RE 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 26(5), 1651\u20131686 (1998)","journal-title":"Annals of Statistics"},{"issue":"4","key":"53_CR17","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TNN.2010.2040484","volume":"21","author":"C Shen","year":"2010","unstructured":"Shen, C., Li, H.: Boosting through optimization of margin distributions. IEEE Transactions on Neural Networks 21(4), 659\u2013666 (2010)","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"12","key":"53_CR18","doi-asserted-by":"publisher","first-page":"2216","DOI":"10.1109\/TPAMI.2010.47","volume":"32","author":"C Shen","year":"2010","unstructured":"Shen, C., Li, H.: On the dual formulation of boosting algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence 32(12), 2216\u20132231 (2010)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Viola, P.A., Jones, M.J.: Rapid object detection using a boosted cascade of simple features. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pp. 511\u2013518 (2001)","DOI":"10.1109\/CVPR.2001.990517"},{"issue":"7","key":"53_CR20","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1007\/s11432-012-4602-y","volume":"55","author":"L Wang","year":"2012","unstructured":"Wang, L., Deng, X., Jing, Z., Feng, J.: Further results on the margin explanation of boosting: New algorithm and experiments. Science China Information Sciences 55(7), 1551\u20131562 (2012)","journal-title":"Science China Information Sciences"},{"key":"53_CR21","first-page":"1835","volume":"12","author":"L Wang","year":"2011","unstructured":"Wang, L., Sugiyama, M., Jing, Z., Yang, C., Zhou, Z.H., Feng, J.: A refined margin analysis for boosting algorithms via equilibrium margin. Journal of Machine Learning Research 12, 1835\u20131863 (2011)","journal-title":"Journal of Machine Learning Research"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18038-0_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T16:39:32Z","timestamp":1747931972000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18038-0_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180373","9783319180380"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18038-0_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}