{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:53Z","timestamp":1725488453933},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423430"},{"type":"electronic","value":"9783540445814"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44581-1_19","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:13:49Z","timestamp":1186726429000},"page":"289-302","source":"Crossref","is-referenced-by-count":2,"title":["On Agnostic Learning with {0, *, 1}-Valued and Real-Valued Hypotheses"],"prefix":"10.1007","author":[{"given":"Philip M.","family":"Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1145\/263867.263927","volume":"44","author":"N. Alon","year":"1997","unstructured":"N. Alon, S. Ben-David, N. Cesa-Bianchi, and D. Haussler. Scale-sensitive dimensions, uniform convergence, and learnability. Journal of the Association for Computing Machinery, 44(4):616\u2013631, 1997.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"M. Anthony and P.L. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.","DOI":"10.1017\/CBO9780511624216"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P.L. Bartlett","year":"1998","unstructured":"P.L. Bartlett. The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 44(2):525\u2013536, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"19_CR4","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jcss.1997.1557","volume":"56","author":"P.L. Bartlett","year":"1998","unstructured":"P.L. Bartlett and P.M. Long. Prediction, learning, uniform convergence, and scale-sensitive dimensions. Journal of Computer and System Sciences, 56(2):174\u2013190, 1998.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1006\/jcss.1996.0033","volume":"52","author":"P.L. Bartlett","year":"1996","unstructured":"P.L. Bartlett, P.M. Long, and R.C. Williamson. Fat-shattering and the learnability of real-valued functions. Journal of Computer and System Sciences, 52(3):434\u2013452, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR6","unstructured":"S. Ben-David and H.U. Simon. Efficient learning of linear perceptrons. Advances in Neural Information Processing Systems 14, 2000."},{"key":"19_CR7","unstructured":"Shai Ben-David, Nadav Eiron, and Hans U. Simon. The computational complexity of densest region detection. Proceedings of the 2000 Conference on Computational Learning Theory, 2000."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"A. Blum, P. Chalasani, S. Goldman, and D.K. Slonim. Learning with unreliable boundary queries. Proceedings of the 1995 Conference on Computational Learning Theory, pages 98\u2013107, 1995.","DOI":"10.1145\/225298.225310"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. JACM, 36(4):929\u2013965, 1989.","journal-title":"JACM"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"K.L. Buescher and P.R. Kumar. Learning stochastic functions by smooth simultaneous estimation. Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, pages 272\u2013279, 1992.","DOI":"10.1145\/130385.130415"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"N. Cristianini and J. Shawe-Taylor. An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, 2000.","DOI":"10.1017\/CBO9780511801389"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Y. Freund, R.E. Schapire, Y. Singer, and M.K. Warmuth. Using and combining predictors that specialize. Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997.","DOI":"10.1145\/258533.258616"},{"issue":"1","key":"19_CR13","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","volume":"100","author":"D. Haussler","year":"1992","unstructured":"D. Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78\u2013150, 1992.","journal-title":"Information and Computation"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","volume":"95","author":"D. Haussler","year":"1991","unstructured":"D. Haussler, M. Kearns, N. Littlestone, and M.K. Warmuth. Equivalence of models for polynomial learnability. Information and Computation, 95:129\u2013161, 1991.","journal-title":"Equivalence of models for polynomial learnability. Information and Computation"},{"issue":"2","key":"19_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/inco.1994.1097","volume":"115","author":"D. Haussler","year":"1994","unstructured":"D. Haussler, N. Littlestone, and M. K. Warmuth. Predicting {0, 1}-functions on randomly drawn points. Information and Computation, 115(2):129\u2013161, 1994.","journal-title":"Information and Computation"},{"issue":"3","key":"19_CR16","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1016\/S0022-0000(05)80062-5","volume":"48","author":"M.J. Kearns","year":"1994","unstructured":"M.J. Kearns and R.E. Schapire. Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48(3):464\u2013497, 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR17","first-page":"115","volume":"17","author":"M.J. Kearns","year":"1994","unstructured":"M.J. Kearns, R.E. Schapire, and L.M. Sellie. Toward efficient agnostic learning. Machine Learning, 17:115\u2013141, 1994.","journal-title":"Machine Learning"},{"key":"19_CR18","unstructured":"V.N. Vapnik. Estimation of Dependencies based on Empirical Data. Springer Verlag, 1982."},{"issue":"2","key":"19_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"V.N. Vapnik and A.Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264\u2013280, 1971.","journal-title":"Theory of Probability and its Applications"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44581-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T02:03:19Z","timestamp":1550714599000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}