{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:47Z","timestamp":1725565427730},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222828"},{"type":"electronic","value":"9783540278191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27819-1_28","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T06:05:39Z","timestamp":1284444339000},"page":"408-414","source":"Crossref","is-referenced-by-count":2,"title":["A New PAC Bound for Intersection-Closed Concept Classes"],"prefix":"10.1007","author":[{"given":"Peter","family":"Auer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Ortner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(97)00019-4","volume":"185","author":"P. Auer","year":"1997","unstructured":"Auer, P.: Learning Nested Differences in the Presence of Malicious Noise. Theor. Comput. Sci.\u00a0185(1), 159\u2013175 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"28_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1018960107028","volume":"23","author":"P. Auer","year":"1998","unstructured":"Auer, P., Cesa-Bianchi, N.: On-Line Learning with Malicious Noise and the Closure Algorithm. Annals of Mathematics and Artificial Intelligence\u00a023(1-2), 83\u201399 (1998)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"28_CR3","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1006\/jcss.1998.1593","volume":"57","author":"P. Auer","year":"1998","unstructured":"Auer, P., Long, P.M., Srinivasan, A.: Approximating Hyper-Rectangles: Learning and Pseudorandom Sets. J. Comput. Syst. Sci.\u00a057(3), 376\u2013388 (1998)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"28_CR4","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, D., Haussler, M.: Learnability and the Vapnik- Chervonenkis Dimension. J. ACM\u00a036(4), 929\u2013965 (1989)","journal-title":"J. ACM"},{"issue":"3","key":"28_CR5","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"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/inco.1994.1097","volume":"115","author":"D. Haussler","year":"1994","unstructured":"Haussler, D., Littlestone, N., Warmuth, M.: Predicting 0,1Functions on Randomly Drawn Points. Inf. Comput.\u00a0115(2), 248\u2013292 (1994)","journal-title":"Inf. Comput."},{"key":"28_CR7","first-page":"165","volume":"5","author":"D. Helmbold","year":"1990","unstructured":"Helmbold, D., Sloan, R., Warmuth, M.: Learning Nested Differences of Intersection- Closed Concept Classes. Machine Learning\u00a05, 165\u2013196 (1990)","journal-title":"Machine Learning"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0097539794268406","volume":"27","author":"F.T. Leighton","year":"1998","unstructured":"Leighton, F.T., Plaxton, C.G.: Hypercubic Sorting Networks. SIAM J. Comput.\u00a027(1), 1\u201347 (1998)","journal-title":"SIAM J. Comput."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1972","unstructured":"Sauer, N.: On the Density of Families of Sets. J. Combinatorial Theory (A)\u00a013, 145\u2013147 (1972)","journal-title":"J. Combinatorial Theory (A)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27819-1_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:44Z","timestamp":1620012584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27819-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222828","9783540278191"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27819-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}