{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:15:51Z","timestamp":1725560151276},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_25","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:10:53Z","timestamp":1279840253000},"page":"329-343","source":"Crossref","is-referenced-by-count":0,"title":["Random Subclass Bounds"],"prefix":"10.1007","author":[{"given":"Shahar","family":"Mendelson","sequence":"first","affiliation":[]},{"given":"Petra","family":"Philips","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Bartlett, P.L., Bousquet, O., Mendelson, S.: Local Rademacher Complexities (preprint)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1162\/153244302760200650","volume":"2","author":"A.H. Cannon","year":"2002","unstructured":"Cannon, A.H., Ettinger, J.M., Hush, D.R., Scovel, J.C.: Machine learning with data dependent hypothesis classes. JMLR\u00a02, 335\u2013358 (2002)","journal-title":"JMLR"},{"issue":"3","key":"25_CR3","first-page":"269","volume":"21","author":"S. Floyd","year":"1995","unstructured":"Floyd, S., Warmuth, M.: Sample compression, learnability, and the Vapnik- Chervonenkis dimension. Machine Learning\u00a021(3), 269\u2013304 (1995)","journal-title":"Machine Learning"},{"key":"25_CR4","unstructured":"Gat, Y.: A bound concerning the generalization ability of a certain class of learning algorithms, Tech. Rep. No. 548, Univ. of California, Berkeley (March 1999)"},{"key":"25_CR5","unstructured":"Graepel, T., Herbrich, R., Shawe-Taylor, J.: Generalisation Error Bounds for Sparse Linear Classifiers. In: Proc. 13th Annu. Conf. on Comput. Learning Theory (2000)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1162\/153244303765208368","volume":"3","author":"R. Herbrich","year":"2002","unstructured":"Herbrich, R., Williamson, R.C.: Algorithmic luckiness. JMLR\u00a03, 175\u2013212 (2002)","journal-title":"JMLR"},{"key":"25_CR7","unstructured":"Littlestone, N., Warmuth, M.: Relating Data Compression and Learnability. Univ. of California, Santa Cruz (1986) (unpublished manuscript)"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/18.971753","volume":"48","author":"S. Mendelson","year":"2002","unstructured":"Mendelson, S.: Rademacher averages and phase transitions in Glivenko-Cantelli class. IEEE Trans. on Inform. Th.\u00a048(1), 251\u2013263 (2002)","journal-title":"IEEE Trans. on Inform. Th."},{"issue":"7","key":"25_CR9","doi-asserted-by":"publisher","first-page":"1977","DOI":"10.1109\/TIT.2002.1013137","volume":"48","author":"S. Mendelson","year":"2002","unstructured":"Mendelson, S.: Improving the sample complexity using global data. IEEE Trans. on Inform. Th.\u00a048(7), 1977\u20131991 (2002)","journal-title":"IEEE Trans. on Inform. Th."},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36434-X_1","volume-title":"Advanced Lectures on Machine Learning","author":"S. Mendelson","year":"2003","unstructured":"Mendelson, S.: A few notes on Statistical Learning Theory. In: Mendelson, S., Smola, A.J. (eds.) Advanced Lectures on Machine Learning. LNCS, vol.\u00a02600, pp. 1\u201340. Springer, Heidelberg (2003)"},{"key":"25_CR11","unstructured":"Mendelson, S., Philips, P.: On the importance of small coordinate projections. JMLR (to appear)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Surveys in Combinatorics. London Math. Soc. Lect. Note Series, vol.\u00a0141, pp. 148\u2013188 (1989)","DOI":"10.1017\/CBO9781107359949.008"},{"issue":"5","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1109\/18.705570","volume":"44","author":"J. Shawe-Taylor","year":"1998","unstructured":"Shawe-Taylor, J., Bartlett, P.L., Williamson, R.C., Anthony, M.: Structural risk minimization over data-dependent hierarchies. IEEE Trans. on Inform. Th.\u00a044(5), 1926\u20131940 (1998)","journal-title":"IEEE Trans. on Inform. Th."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1214\/aop\/1065725175","volume":"24","author":"M. Talagrand","year":"1996","unstructured":"Talagrand, M.: Majorizing measures: The generic chaining. Ann. Probab.\u00a024, 1049\u20131103 (1996)","journal-title":"Ann. Probab."}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T07:13:45Z","timestamp":1552806825000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}