{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T18:16:58Z","timestamp":1780337818031,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bf00993408","type":"journal-article","created":{"date-parts":[[2005,1,14]],"date-time":"2005-01-14T18:17:14Z","timestamp":1105726634000},"page":"131-148","source":"Crossref","is-referenced-by-count":50,"title":["Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers"],"prefix":"10.1007","volume":"18","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark R.","family":"Jerrum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Alt, H., Behrends, B., & Bl\u00f6mer, J. (1991). Approximate Matching of Polygonal Shapes.Procs. of the 1991 ACM Symposium on Computational Geometry pp. 186?193."},{"key":"CR2","unstructured":"Anthony, M., & Biggs, N. (1992).Computational Learning Theory: an Introduction, Cambridge University Press, 1992."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(83)90042-X","volume":"17","author":"M.J. Attalah","year":"1983","unstructured":"Attalah, M.J. (1983). A Linear Time Algorithm for the Hausdorff-distance between Convex Polygons.Information Processing Letters 17 pp. 207?209.","journal-title":"Information Processing Letters"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","volume":"1","author":"E.B. Baum","year":"1988","unstructured":"Baum, E.B., & Haussler, D. (1988). What Size Net Gives Valid Generalization?Neural Computation 1, pp. 151?160.","journal-title":"Neural Computation"},{"key":"CR5","unstructured":"Ben-David, S., & Lindenbaum, M. (1993). Localization vs. Identification of Semi-Algebraic Sets.Proceedings of the 6th Annual ACM Conference on Computational Learning Theory, pp. 327?336."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Ben-Or, M. (1983). Lower Bounds for Algebraic Computation Trees.Proceedings of the 15th Annual ACM Symposium on the Theory of Computing, pp. 80?86.","DOI":"10.1145\/800061.808735"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1987). Occam's Razor.Information Processing Letters 24 pp. 377?380.","journal-title":"Information Processing Letters"},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M.K. (1989). Learnability and the Vapnik-Chervonenkis Dimension.Journal of the Association for Computing Machinery 36 No. 4, pp. 929?965.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1214\/aop\/1176995384","volume":"6","author":"R.M. Dudley","year":"1978","unstructured":"Dudley, R.M. (1978). Central Limit Theorems for Empirical Measures,Annals of Probability 6, pp. 899?929.","journal-title":"Annals of Probability"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L.G. (1989). A General Lower Bound on the Number of Examples Needed for Learning.Information and Computation 82, pp. 247?261.","journal-title":"Information and Computation"},{"key":"CR11","unstructured":"Goldberg, P. (1992). PAC-Learning Geometrical Figures.PhD thesis, Department of Computer Science, University of Edinburgh (1992)."},{"key":"CR12","volume-title":"Combinatorial Theory","author":"M. Hall","year":"1967","unstructured":"Hall, M. (1967).Combinatorial Theory, Blaisdell, Waltham MA (1967)."},{"key":"CR13","unstructured":"Haussler, D., Littlestone, N., & Warmuth, M.K. (1988). Predicting {0,1} functions on randomly drawn points.Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pp. 100?109."},{"issue":"2","key":"CR14","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1112\/jlms\/s2-45.2.377","volume":"45","author":"M.C. Laskowski","year":"1992","unstructured":"Laskowski, M.C. (1992). Vapnik-Chervonenkis Classes of Definable Sets.J. London Math. Society (2) 45, pp. 377?384.","journal-title":"J. London Math. Society"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0890-5401(91)90058-A","volume":"90","author":"N. Linial","year":"1991","unstructured":"Linial, N., Mansour, Y., & Rivest, R. (1991). Results on Learnability and the Vapnik-Chervonenkis Dimension.Information and Computation 90, pp. 33?49.","journal-title":"Information and Computation"},{"key":"CR16","unstructured":"Maass, W. (1992). Bounds for the Computational Power and Learning Complexity of Analog Neural Nets.Insts. for Information Processing Graz, report 349; Oct. 1992. Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (1993), pp. 335?344."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Macintyre, A. & Sontag, E.D. (1993). Finiteness Results for Sigmoidal ?Neural? Networks,Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 325?334.","DOI":"10.1145\/167088.167192"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9939-1964-0161339-9","volume":"15","author":"J. Milnor","year":"1964","unstructured":"Milnor, J. (1964). On the Betti Numbers of Real Varieties.Procs. of the American Mathematical Society 15, pp. 275?280.","journal-title":"Procs. of the American Mathematical Society"},{"key":"CR19","unstructured":"Natarajan, B.K. (1991)Machine Learning: A Theoretical Approach. Morgan Kaufman Publishers, Inc., ISBN 1-55860-148-1"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"Renegar, J. (1992). On the Computational Complexity and Geometry of the First-Order Theory of the Reals. Part 1 (of 3).Journal of Symbolic Computation 13, pp. 255?299.","journal-title":"Journal of Symbolic Computation"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0022-0000(92)90039-L","volume":"45","author":"E.D. Sontag","year":"1992","unstructured":"Sontag, E.D. (1992). Feedforward Nets for Interpolation and Classification,Journal of Computer and System Sciences 45, pp. 20?48.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","volume":"3","author":"J.M. Steele","year":"1982","unstructured":"Steele, J.M. & Yao, A.C. (1982). Lower Bounds for Algebraic Decision Trees.Journal of Algorithms 3, pp. 1?8.","journal-title":"Journal of Algorithms"},{"key":"CR23","doi-asserted-by":"crossref","first-page":"1441","DOI":"10.1214\/aos\/1176347373","volume":"17","author":"G. Stengle","year":"1989","unstructured":"Stengle, G., & Yukich, J.E. (1989). Some New Vapnik-Chervonenkis Classes, Annals of Statistics17, pp. 1441?1446.","journal-title":"Annals of Statistics"},{"issue":"11","key":"CR24","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G. (1984). A Theory of the Learnable.Communications of the ACM 27 No. 11, pp. 1134?1142.","journal-title":"Communications of the ACM"},{"key":"CR25","unstructured":"Valiant, L.G. (1985). Learning Disjunctions of Conjunctions.Procs of the 9th International Joint Conference on AI, pp. 560?566."},{"key":"CR26","unstructured":"Valiant, L.G. (1991). A View of Computational Learning Theory.NEC Research Symposium: Computation and Cognition (ed. C.W. Gear), SIAM, Philadelphia, 1991."},{"issue":"2","key":"CR27","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., & Chervonenkis, A. Ya. (1971). On the uniform convergence of relative frequencies of events to their probabilities.Theory of Probability and its Applications 16, No. 2 pp. 264?280.","journal-title":"Theory of Probability and its Applications"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/S0002-9947-1968-0226281-1","volume":"133","author":"H.E. Warren","year":"1968","unstructured":"Warren, H.E. (1968). Lower Bounds for Approximation by Non-linear Manifolds.Trans. of the AMS 133, pp. 167?178.","journal-title":"Trans. of the AMS"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0012-365X(81)90274-0","volume":"33","author":"R.S. Wenocur","year":"1981","unstructured":"Wenocur, R.S., & Dudley, R.M. (1981). Some special Vapnik-Chervonenkis classes.Discrete Mathematics 33, pp. 313?318.","journal-title":"Discrete Mathematics"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993408.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00993408\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T22:58:45Z","timestamp":1556578725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00993408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":29,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1995]]}},"alternative-id":["BF00993408"],"URL":"https:\/\/doi.org\/10.1007\/bf00993408","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}