{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:02:57Z","timestamp":1648904577406},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":[[1996,10]]},"DOI":"10.1007\/bf00115300","type":"journal-article","created":{"date-parts":[[2004,11,1]],"date-time":"2004-11-01T02:11:46Z","timestamp":1099275106000},"page":"51-70","source":"Crossref","is-referenced-by-count":3,"title":["PAC learning of one-dimensional patterns"],"prefix":"10.1007","volume":"25","author":[{"given":"Paul W.","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sally A.","family":"Goldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen D.","family":"Scott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"Anthony, M., & Biggs, N. (1992).Computational Learning Theory: an Introduction. Cambridge University Press."},{"key":"CR2","series-title":"Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory","first-page":"437","volume-title":"Specification and simulation of statistical query algorithms for efficiency and noise tolerance","author":"A. Aslam","year":"1995","unstructured":"AslamA., & DecaturS. (1995). Specification and simulation of statistical query algorithms for efficiency and noise tolerance.Proceedings of the Eighth Annual ACM Conference on Computational Learning Theory (pp. 437?446). New York, NY: ACM Press."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"BlumerA., EhrenfeuchtA., HausslerD., & WarmuthM. K. (1987). Occam's Razor.Information Processing Letters, 24, 377?380.","journal-title":"Information Processing Letters"},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"BlumerA., EhrenfeuchtA., HausslerD., & WarmuthM. K. (1989). Learnability and the Vapnik-Chervonenkis Dimension.Journal of the Association for Computing Machinery, 36(4), 929?965.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"EhrenfeuchtA., HausslerD., KearnsM., & ValiantL. G. (1989). A General Lower Bound on the Number of Examples Needed for Learning.Information and Computation, 82, 247?261.","journal-title":"Information and Computation"},{"key":"CR6","series-title":"Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory","first-page":"246","volume-title":"Learning one-dimensional geometric patterns under one-sided random misclassification noise","author":"P. Goldberg","year":"1994","unstructured":"GoldbergP., & GoldmanS. (1994). Learning one-dimensional geometric patterns under one-sided random misclassification noise.Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory (pp. 246?255). New York, NY: ACM Press."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Goldberg, P. & Jerrum, M. (1995) Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers.Machine Learning, 18, 131?148. Special issue for theSixth Annual ACM Conference on Computational Learning Theory.","DOI":"10.1007\/BF00993408"},{"key":"CR8","unstructured":"Goldberg, P. (1992).PAC-Learning Geometrical Figures. PhD thesis, Department of Computer Science, University of Edinburgh."},{"key":"CR9","series-title":"Machine Learning: Proceedings of the Thirteenth International Conference","first-page":"191","volume-title":"A theoretical and empirical study of a noise-tolerant algorithm to learn geometric patterns","author":"S. Goldman","year":"1996","unstructured":"GoldmanS. & ScottS. (1996). A theoretical and empirical study of a noise-tolerant algorithm to learn geometric patterns.Machine Learning: Proceedings of the Thirteenth International Conference (pp. 191?199). San Francisco, CA: Morgan Kaufmann."},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Gruber, P. M. (1983). Approximation of convex bodies. In P. M. Gruber and P. M. Willis, editors,Convexity and its applications. Brikhauser Verlag.","DOI":"10.1007\/978-3-0348-5858-8_7"},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","volume":"95","author":"D. Haussler","year":"1991","unstructured":"HausslerD., KearnsM., LittlestoneN., & WarmuthM. K. (1991). Equivalence of models for polynomial learnability.Information and Computation, 95(2), 129?161.","journal-title":"Information and Computation"},{"key":"CR12","doi-asserted-by":"crossref","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).","DOI":"10.1109\/SFCS.1988.21928"},{"issue":"1","key":"CR13","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/37.120451","volume":"12","author":"J. Hong","year":"1992","unstructured":"HongJ., TanX., PinetteB., WeissR., & RisemanE. M. (1992). Image-based homing.IEEE Control Systems Magazine, 12(1), 38?45.","journal-title":"IEEE Control Systems Magazine"},{"key":"CR14","series-title":"Proceedings of the 25th Annuual ACM Symposium on Theory of Computing","first-page":"392","volume-title":"Efficient noise-tolerant learning from statistical queries","author":"M. Kearns","year":"1993","unstructured":"KearnsM. (1993). Efficient noise-tolerant learning from statistical queries.Proceedings of the 25th Annuual ACM Symposium on Theory of Computing (pp. 392?401). New York, NY: ACM Press."},{"key":"CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M. Kearns","year":"1994","unstructured":"KearnsM. & VaziraniU. (1994).An Introduction to Computational Learning Theory. Cambridge, MA: MIT Press."},{"issue":"3","key":"CR16","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0004-3702(90)90027-W","volume":"44","author":"T. S. Levitt","year":"1990","unstructured":"LevittT. S. & LawtonD. T. (1990). Qualitative navigation for mobile robots.Artificial Intelligence, 44(3), 305?360.","journal-title":"Artificial Intelligence"},{"key":"CR17","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"LittlestoneN. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm.Machine Learning 2, 285?318.","journal-title":"Machine Learning"},{"key":"CR18","volume-title":"Machine Learning: A Theoretical Approach","author":"B. K. Natarajan","year":"1991","unstructured":"NatarajanB. K. (1991).Machine Learning: A Theoretical Approach. San Francisco, CA: Morgan Kaufman Publishers."},{"key":"CR19","unstructured":"Pinette, B. (1993).Image-Based Navigation Through Large-Scaled Environments. PhD thesis, University of Massachusetts, Amherst."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"PittL. & ValiantL. (1988). Computational limitations on learning from examples.J ACM, 35, 965?984.","journal-title":"J ACM"},{"issue":"3","key":"CR21","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","volume":"41","author":"L. Pitt","year":"1990","unstructured":"PittL. & WarmuthM. K. (1990). Prediction preserving reducibility.J. of Comput. Syst. Sci., 41(3), 430?467. Special issue of the for theThird Annual Conference of Structure in Complexity Theory (Washington, DC., June 1988).","journal-title":"J. of Comput. Syst. Sci."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0747-7171(10)80003-3","volume":"13","author":"J. Renegar","year":"1992","unstructured":"RenegarJ. (1992). On the Computational Complexity and Geometry of the First-Order Theory of the Reals. Part 1 (of 3).Journal of Symbolic Computation, 13, 255?299.","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"CR23","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/rob.4620050505","volume":"5","author":"H. Suzuki","year":"1988","unstructured":"SuzukiH. & ArimotoS. (1988). Visual control of autonomous mobile robot based on self-organizing model for pattern learning.Journal of Robotic Systems, 5(5), 453?470.","journal-title":"Journal of Robotic Systems"},{"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":"ValiantL. G. (1984). A Theory of the Learnable.Communications of the ACM, 27(11), 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","series-title":"NEC Research Symposium: Computation and Cognition","volume-title":"A View of Computational Learning Theory","author":"L. G. Valiant","year":"1991","unstructured":"ValiantL. G. (1991). A View of Computational Learning Theory.NEC Research Symposium: Computation and Cognition (ed. C. W.Gear), SIAM, Philadelphia."},{"issue":"2","key":"CR27","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. N. Vapnik","year":"1971","unstructured":"VapnikV. N., & ChervonenkisA. Ya. (1971). On the uniform convergence of relative frequencies of events to their probabilities.Theory of Probability and its Applications, 16(2), 264?280.","journal-title":"Theory of Probability and its Applications"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00115300.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00115300\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00115300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T17:13:08Z","timestamp":1585933988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00115300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["BF00115300"],"URL":"https:\/\/doi.org\/10.1007\/bf00115300","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}