{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T17:00:50Z","timestamp":1693587650332},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T00:00:00Z","timestamp":1337126400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11432-012-4602-y","type":"journal-article","created":{"date-parts":[[2012,5,16]],"date-time":"2012-05-16T15:03:14Z","timestamp":1337180594000},"page":"1551-1562","source":"Crossref","is-referenced-by-count":5,"title":["Further results on the margin explanation of boosting: new algorithm and experiments"],"prefix":"10.1007","volume":"55","author":[{"given":"LiWei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiaoCheng","family":"Deng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZhaoXiang","family":"Jing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JuFu","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,16]]},"reference":[{"key":"4602_CR1","unstructured":"Freund Y, Schapire R E. Experiments with a new boosting algorithm. In: International Conference on Machine Learning (ICML), Bari, 1996"},{"key":"4602_CR2","doi-asserted-by":"crossref","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, 1997, 55: 119\u2013139","journal-title":"J Comput Syst Sci"},{"key":"4602_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1007515423169","volume":"36","author":"E. Bauer","year":"1999","unstructured":"Bauer E, Kohavi R. An empirical comparison of voting classification algorithms: Bagging, boosting and variants. Mach Learn, 1999, 36: 105\u2013139","journal-title":"Mach Learn"},{"key":"4602_CR4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T. Dietterich","year":"2000","unstructured":"Dietterich T. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting and randomization. Mach Learn, 2000, 40: 139\u2013157","journal-title":"Mach Learn"},{"key":"4602_CR5","unstructured":"Viola P, Jones M. Rapid object detection using a boosted cascade of simple features. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), Kauai, 2001"},{"key":"4602_CR6","doi-asserted-by":"crossref","unstructured":"Caruana R, Niculescu-Mizil A. An empirical comparison of supervised learning algorithms. In: 23th International Conference on Machine Learning (ICML), Pittsburgh, 2006","DOI":"10.1145\/1143844.1143865"},{"key":"4602_CR7","doi-asserted-by":"crossref","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. Ann Stat, 2000, 28: 337\u2013407","journal-title":"Ann Stat"},{"key":"4602_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1214\/aos\/1079120128","volume":"32","author":"W. Jiang","year":"2004","unstructured":"Jiang W. Process consistency for adaboost. Ann Stat, 2004, 32: 13\u201329","journal-title":"Ann Stat"},{"key":"4602_CR9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1214\/009053604000000463","volume":"32","author":"W. Lugosi","year":"2004","unstructured":"Lugosi W, Vayatis N. On the bayes-risk consistency of regularized boosting methods. Ann Stat, 2004, 32: 30\u201355","journal-title":"Ann Stat"},{"key":"4602_CR10","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1214\/aos\/1079120130","volume":"32","author":"T. Zhang","year":"2004","unstructured":"Zhang T. Statistical behavior and consistency of classification methods based on convex risk minimization. Ann Stat, 2004, 32: 56\u201385","journal-title":"Ann Stat"},{"key":"4602_CR11","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1198\/016214505000000907","volume":"101","author":"P. Bartlett","year":"2006","unstructured":"Bartlett P, Jordan M, McAuliffe J D. Convexity, classification, and risk bounds. J Am Stat Assoc, 2006, 101: 138\u2013156","journal-title":"J Am Stat Assoc"},{"key":"4602_CR12","first-page":"131","volume":"9","author":"D. Mease","year":"2008","unstructured":"Mease D, Wyner A. Evidence contrary to the statistical view of boosting. J Mach Learn Res, 2008, 9: 131\u2013156","journal-title":"J Mach Learn Res"},{"key":"4602_CR13","doi-asserted-by":"crossref","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. Schapire","year":"1998","unstructured":"Schapire R, Freund Y, Bartlett P, et al. Boosting the margin: A new explanation for the effectiveness of voting methods. Ann Stat, 1998, 26: 1651\u20131686","journal-title":"Ann Stat"},{"key":"4602_CR14","unstructured":"Grove A J, Schuurmans D. Boosting in the limit: Maximizing the margin of learned ensembles. In: National Conference on Artificial Intelligence (AAAI), Wisconsin, 1998"},{"key":"4602_CR15","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1162\/089976699300016106","volume":"11","author":"L. Breiman","year":"1999","unstructured":"Breiman L. Prediction games and arcing algorithms. Neural Comput, 1999, 11: 1493\u20131517","journal-title":"Neural Comput"},{"key":"4602_CR16","doi-asserted-by":"crossref","unstructured":"Reyzin L, Schapire R E. How boosting the margin can also boost classifier complexity. In: International Conference on Machine Learning (ICML), 2006","DOI":"10.1145\/1143844.1143939"},{"key":"4602_CR17","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. Ann Stat, 2002, 30: 1\u201350","journal-title":"Ann Stat"},{"key":"4602_CR18","doi-asserted-by":"crossref","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. Ann Stat, 2005, 33: 1455\u20131496","journal-title":"Ann Stat"},{"key":"4602_CR19","unstructured":"Wang L, Sugiyama M, Yang C, et al. On the margin explanation of boosting algorithms. In: 21th Annual Conference on Learning Theory (COLT), Helsinki, 2008"},{"key":"4602_CR20","first-page":"1835","volume":"12","author":"L. Wang","year":"2011","unstructured":"Wang L, Sugiyama M, Jing Z, et al. A Refined Margin Analysis for Boosting Algorithms via Equilibrium Margin. J Mach Learn Res, 2011, 12: 1835\u20131863","journal-title":"J Mach Learn Res"},{"key":"4602_CR21","volume-title":"Proceedings of Advances in Neural Information Processing Systems (NIPS))","author":"G. R\u00e4tsch","year":"1999","unstructured":"R\u00e4tsch G, Sch\u00f6lkopf B, Smola A, et al. \u03bd-arc: Ensemble learning in the presense of outliers. In: Solla S A, Leen T, M\u00fcller K-R, eds. Proceedings of Advances in Neural Information Processing Systems (NIPS)). Cambridge: MIT Press, 1999"},{"key":"4602_CR22","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1023\/A:1012470815092","volume":"46","author":"A. Demiriz","year":"2002","unstructured":"Demiriz A, Bennet K, Shawe-Taylor J. Linear programming boosting via column generation. Mach Learn, 2002, 46: 225\u2013254","journal-title":"Mach Learn"},{"key":"4602_CR23","first-page":"368","volume-title":"Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS)","author":"K. Bennett","year":"1999","unstructured":"Bennett K, Demiriz A. Semi-supervised support vector machines. In: Proceedings of the Conference on Advances in Neural Information Processing Systems (NIPS). Cambridge: MIT Press, 1999. 368\u2013374"},{"key":"4602_CR24","unstructured":"Asuncion A, Newman D J. UCI machine learning repository, 2007. Available from: http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-012-4602-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-012-4602-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-012-4602-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T19:58:30Z","timestamp":1642276710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-012-4602-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,16]]},"references-count":24,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["4602"],"URL":"https:\/\/doi.org\/10.1007\/s11432-012-4602-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,16]]}}}