{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:26:38Z","timestamp":1725542798134},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259121"},{"type":"electronic","value":"9783540320654"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427391_86","type":"book-chapter","created":{"date-parts":[[2009,12,29]],"date-time":"2009-12-29T08:05:42Z","timestamp":1262073942000},"page":"538-545","source":"Crossref","is-referenced-by-count":2,"title":["The Bounds on the Rate of Uniform Convergence for Learning Machine"],"prefix":"10.1007","author":[{"given":"Bin","family":"Zou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luoqing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,4,23]]},"reference":[{"key":"86_CR1","first-page":"123","volume":"26","author":"L. Breiman","year":"1996","unstructured":"Breiman, L.: Bagging Predictors. Machine Learning\u00a026, 123\u2013140 (1996)","journal-title":"Machine Learning"},{"key":"86_CR2","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. Shapire","year":"1998","unstructured":"Shapire, R., Freund, Y., Bartlett, P., Lee, W.: Boosting the Margin: A New Explanation for the Effectiveness of Voting Methods. The Annals of Statistics\u00a026, 1651\u20131686 (1998)","journal-title":"The Annals of Statistics"},{"key":"86_CR3","volume-title":"Statistical Learning Theory","author":"V. Vapnik","year":"1998","unstructured":"Vapnik, V.: Statistical Learning Theory. John Wiley, New York (1998)"},{"key":"86_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1002\/(SICI)1098-2418(200005)16:3<277::AID-RSA4>3.0.CO;2-1","volume":"16","author":"S. Boucheron","year":"2000","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: A Sharp Concentration Inequality with Applications. Random Structures and Algorithms\u00a016, 277\u2013292 (2000)","journal-title":"Random Structures and Algorithms"},{"key":"86_CR5","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. Journal of Machine Learning Research\u00a02, 499\u2013526 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"86_CR6","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-onout Cross-validation. Neural Computation\u00a011, 1427\u20131453 (1999)","journal-title":"Neural Computation"},{"key":"86_CR7","unstructured":"Kutin, S., Niyogi, P.: Almost-everywhere Algorithmic Stability and Generalization Error. In: The 18th Conference in Vncertainty in Artificial Intelligence, Canada (2002)"},{"key":"86_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1006\/jcss.2001.1798","volume":"64","author":"J. Forster","year":"2002","unstructured":"Forster, J., Warmuth, M.: Relative Expected Instantaneous Loss Bounds. Journal of Computer and System Science\u00a064, 76\u2013102 (2002)","journal-title":"Journal of Computer and System Science"},{"key":"86_CR9","unstructured":"Jaakkola, T., Hausler, D.: Probabilistic Kernel Regression Models. In: The 7th International Workshop on Artificial Intelligence and Statistics, USA (1999)"},{"key":"86_CR10","unstructured":"Joachims, T.: Estimating the Generalization Performance of an SVM Efficiently. In: The 17th International Conference on Machine learning, USA (2000)"},{"key":"86_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-01-00923-5","volume":"39","author":"F. Cucker","year":"2002","unstructured":"Cucker, F., Smale, S.: On the Mathematical Foundations of Learning. Bulletin of the American Mathematical Society\u00a039, 1\u201349 (2002)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"86_CR12","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TIT.1979.1056087","volume":"25","author":"L. Devroye","year":"1979","unstructured":"Devroye, L., Wagner, T.: Distribution-free Performance Bounds for Potential Function Rules. IEEE Trans. Inform. Theory\u00a025, 601\u2013604 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"86_CR13","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the Method of Bounded Defferences. London Mathematical Lecture Note Series, vol.\u00a0141, pp. 148\u2013188 (1989)","DOI":"10.1017\/CBO9781107359949.008"}],"container-title":["Lecture Notes in Computer Science","Advances in Neural Networks \u2014 ISNN 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427391_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:56:00Z","timestamp":1605642960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427391_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259121","9783540320654"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11427391_86","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2005]]}}}