{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T02:10:22Z","timestamp":1736561422871,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_28","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"364-378","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Lecu\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","unstructured":"Audibert, J.-Y., Tsybakov, A.B.: Fast learning rates for plug-in classifiers under margin condition (2005) (Preprint PMA-998), available at: http:\/\/www.proba.jussieu.fr\/mathdoc\/preprints\/index.html#2005"},{"key":"28_CR2","unstructured":"Barron, A., Leung, G.: Information theory and mixing least-square regressions (manuscript, 2004)"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"603","DOI":"10.2307\/2533961","volume":"53","author":"A. Barron","year":"1997","unstructured":"Barron, A., Li, J.: Mixture density estimation. Biometrics\u00a053, 603\u2013618 (1997)","journal-title":"Biometrics"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"P. Bartlett","year":"1998","unstructured":"Bartlett, P., Freund, Y., Lee, W.S., Schapire, R.E.: Boosting the margin: a new explanantion for the effectiveness of voting methods. Annals of Statistics\u00a026, 1651\u20131686 (1998)","journal-title":"Annals of Statistics"},{"key":"28_CR5","unstructured":"Bartlett, P., Jordan, M., McAuliffe, J.: Convexity, Classification and Risk Bounds, Technical Report 638, Department of Statistics, U.C. Berkeley (2003), available at: http:\/\/stat-www.berkeley.edu\/tech-reports\/638.pdf"},{"key":"28_CR6","unstructured":"Blanchard, G., Bousquet, O., Massart, P.: Statistical Performance of Support Vector Machines (2004), available at: http:\/\/mahery.math.u-psud.fr\/~blanchard\/publi\/"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1051\/ps:2005018","volume":"9","author":"S. Boucheron","year":"2005","unstructured":"Boucheron, S., Bousquet, O., Lugosi, G.: Theory of classification: A survey of some recent advances. ESAIM: Probability and statistics\u00a09, 325\u2013375 (2005)","journal-title":"ESAIM: Probability and statistics"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1162\/1532443041424319","volume":"4","author":"G. Blanchard","year":"2003","unstructured":"Blanchard, G., Lugosi, G., Vayatis, N.: On the rate of convergence of regularized boosting classifiers. JMLR\u00a04, 861\u2013894 (2003)","journal-title":"JMLR"},{"issue":"4","key":"28_CR9","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1214\/aos\/1031689014","volume":"30","author":"P. B\u00fchlmann","year":"2002","unstructured":"B\u00fchlmann, P., Yu, B.: Analyzing bagging. Ann. Statist.\u00a030(4), 927\u2013961 (2002)","journal-title":"Ann. Statist."},{"key":"28_CR10","volume-title":"An introduction to Support Vector Machines","author":"N. Cristianini","year":"2002","unstructured":"Cristianini, N., Shawe-Taylor, J.: An introduction to Support Vector Machines. Cambridge University Press, Cambridge (2002)"},{"issue":"3","key":"28_CR11","first-page":"273","volume":"20","author":"C. Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-Vector Networks. Machine Learning\u00a020(3), 273\u2013297 (1995)","journal-title":"Machine Learning"},{"key":"28_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","volume-title":"A Probabilistic Theory of Pattern Recognition","author":"L. Devroye","year":"1996","unstructured":"Devroye, L., Gy\u00f6rfi, L., Lugosi, G.: A Probabilistic Theory of Pattern Recognition. Springer, Heidelberg (1996)"},{"key":"28_CR13","unstructured":"Catoni, O.: Statistical Learning Theory and Stochastic Optimization, Ecole d\u2019\u00e9t\u00e9 de Probabilit\u00e9s de Saint-Flour, Lecture Notes in Mathematics. Springer, N.Y. (2001)"},{"key":"28_CR14","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. Statist.\u00a030, 1\u201350 (2002)","journal-title":"Ann. Statist."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Koltchinskii, V.: Local Rademacher Complexities and Oracle Inequalities in Risk Minimization. Ann. Statist. (to appear, 2005)","DOI":"10.1214\/009053606000001082"},{"issue":"1","key":"28_CR16","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1214\/aos\/1079120129","volume":"32","author":"G. Lugosi","year":"2004","unstructured":"Lugosi, G., Vayatis, N.: On the Bayes-risk consistency of regularized boosting methods. Ann. Statist.\u00a032(1), 30\u201355 (2004)","journal-title":"Ann. Statist."},{"key":"28_CR17","unstructured":"Lecu\u00e9, G.: Simultaneous adaptation to the margin and to complexity in classification (2005), available at: http:\/\/hal.ccsd.cnrs.fr\/ccsd-00009241\/en\/"},{"key":"28_CR18","unstructured":"Lecu\u00e9, G.: Optimal rates of aggregation in classification (2006), available at: https:\/\/hal.ccsd.cnrs.fr\/ccsd-00021233"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Massart, P.: Some applications of concentration inequalities to Statistics. Probability Theory. Annales de la Facult\u00e9 des Sciences de Toulouse\u00a02, 245\u2013303 (2000), volume sp\u00e9cial d\u00e9di\u00e9 \u00e0 Michel Talagrand","DOI":"10.5802\/afst.961"},{"key":"28_CR20","unstructured":"Massart, P.: Concentration inequalities and Model Selection. Lectures notes of Saint Flour (2004)"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf, B., Smola, A.: Learning with kernels. MIT press, Cambridge University (2002)","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"28_CR22","unstructured":"Steinwart, I., Scovel, C.: Fast Rates for Support Vector Machines using Gaussian Kernels (2004), Los Alamos National Laboratory Technical Report LA-UR 04-8796 (submitted to Annals of Statistics)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/11503415_19","volume-title":"Learning Theory","author":"I. Steinwart","year":"2005","unstructured":"Steinwart, I., Scovel, C.: Fast Rates for Support Vector Machines. In: Auer, P., Meir, R. (eds.) COLT 2005. LNCS, vol.\u00a03559, pp. 279\u2013294. Springer, Heidelberg (2005)"},{"key":"28_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-45167-9_23","volume-title":"Learning Theory and Kernel Machines","author":"A.B. Tsybakov","year":"2003","unstructured":"Tsybakov, A.B.: Optimal rates of aggregation. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 303\u2013313. Springer, Heidelberg (2003)"},{"issue":"1","key":"28_CR25","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1214\/aos\/1079120131","volume":"32","author":"A.B. Tsybakov","year":"2004","unstructured":"Tsybakov, A.B.: Optimal aggregation of classifiers in statistical learning. Ann. Statist.\u00a032(1), 135\u2013166 (2004)","journal-title":"Ann. Statist."},{"key":"28_CR26","volume-title":"Introduction \u00e0 l\u2019estimation non-param\u00e9trique","author":"A.B. Tsybakov","year":"2004","unstructured":"Tsybakov, A.B.: Introduction \u00e0 l\u2019estimation non-param\u00e9trique. Springer, Heidelberg (2004)"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Vovk, V.G.: Aggregating strategies. In: Proceedings of the Third Annual Workshop on Computational Learning Theory, pp. 371\u2013383 (1990)","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"issue":"1","key":"28_CR28","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1214\/aos\/1016120365","volume":"28","author":"Y. Yang","year":"2000","unstructured":"Yang, Y.: Mixing strategies for density estimation. Ann. Statist.\u00a028(1), 75\u201387 (2000)","journal-title":"Ann. Statist."},{"issue":"1","key":"28_CR29","doi-asserted-by":"publisher","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. Statist.\u00a032(1), 56\u201385 (2004)","journal-title":"Ann. Statist."}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T01:40:03Z","timestamp":1736559603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11776420_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}