{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,13]],"date-time":"2026-10-13T04:26:58Z","timestamp":1791865618950,"version":"4.3.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1023\/a:1007681724516","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T05:54:50Z","timestamp":1040536490000},"page":"5-49","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Theoretical and Empirical Study of a Noise-Tolerant Algorithm to Learn Geometric Patterns"],"prefix":"10.1007","volume":"37","author":[{"given":"Sally A.","family":"Goldman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen D.","family":"Scott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"237029_CR1","unstructured":"Anthony, M., & Biggs, N. (1992). Computational learning theory. Cambridge University Press."},{"key":"237029_CR2","first-page":"282","volume-title":"Proceedings of the 34th Annual Symposium on Foundations of Computer Science","author":"A. Aslam","year":"1993","unstructured":"Aslam, A., & Decatur, S. (1993). General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. Proceedings of the 34th Annual Symposium on Foundations of Computer Science (pp. 282\u2013291). Los Alamitos, CA: IEEE Computer Society Press."},{"key":"237029_CR3","doi-asserted-by":"crossref","unstructured":"Aslam, A., & Decatur, S. (1998). Specification and simulation of statistical query algorithms for efficiency and noise tolerance. Journal of Computer and System Sciences, Earlier version in COLT '95, to appear.","DOI":"10.1006\/jcss.1997.1558"},{"key":"237029_CR4","first-page":"21","volume-title":"Machine Learning: Proceedings of the Fourteenth International Conference","author":"P. Auer","year":"1997","unstructured":"Auer, P. (1997). On learning from multi-instance examples: Empirical evaluation of a theoretical approach. Machine Learning: Proceedings of the Fourteenth International Conference (pp. 21\u201329). San Francisco, CA: Morgan Kaufmann Publishers."},{"key":"237029_CR5","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1145\/258533.258611","volume-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","author":"P. Auer","year":"1997","unstructured":"Auer, P., Long, P. M., & Srinivasan, A. (1997). Approximating hyper-rectangles: Learning and pseudo-random sets. Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing (pp. 314\u2013323). New York, NY: ACM Press."},{"key":"237029_CR6","doi-asserted-by":"publisher","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, 377\u2013380.","journal-title":"Information Processing Letters"},{"issue":"4","key":"237029_CR7","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 ACM, 36(4), 929\u2013965.","journal-title":"Journal of the ACM"},{"key":"237029_CR8","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/168304.168346","volume-title":"Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory","author":"S. Decatur","year":"1993","unstructured":"Decatur, S. (1993). Statistical queries and faulty PAC oracles. Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory (pp. 262\u2013268). New York, NY: ACM Press."},{"key":"237029_CR9","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, 247\u2013261.","journal-title":"Information and Computation"},{"key":"237029_CR10","unstructured":"Goldberg, P. (1992). PAC-learning geometrical figures. Ph.D. thesis, Department of Computer Science, University of Edinburgh."},{"key":"237029_CR11","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/180139.181131","volume-title":"Proceedings of the Seventh Annual ACMConference on Computational Learning Theory","author":"P. Goldberg","year":"1994","unstructured":"Goldberg, P., & Goldman, S. (1994). Learning one-dimensional geometric patterns under one-sided random misclassification noise. Proceedings of the Seventh Annual ACMConference on Computational Learning Theory (pp. 246\u2013255). New York, NY: ACM Press."},{"issue":"1","key":"237029_CR12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1018396106080","volume":"25","author":"P. Goldberg","year":"1996","unstructured":"Goldberg, P., Goldman, S., & Scott, S. (1996). PAC-learning one-dimensional geometric patterns. Machine Learning, 25(1), 51\u201370.","journal-title":"Machine Learning"},{"key":"237029_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1022847329178","volume":"18","author":"P. Goldberg","year":"1995","unstructured":"Goldberg, P., & Jerrum, M. (1995). Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers. Machine Learning, 18, 131\u2013148. Special issue for the Sixth Annual ACM Conference on Computational Learning Theory.","journal-title":"Machine Learning"},{"key":"237029_CR14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/267460.267520","volume-title":"Proceedings of the Tenth Annual Conference on Computational Learning Theory","author":"S. Goldman","year":"1997","unstructured":"Goldman, S., Kwek, S., & Scott, S. (1997). Agnostic learning of geometric patterns. Proceedings of the Tenth Annual Conference on Computational Learning Theory (pp. 325\u2013333). New York, NY: ACM Press."},{"key":"237029_CR15","first-page":"191","volume-title":"Machine Learning: Proceedings of the Thirteenth International Conference","author":"S. Goldman","year":"1996","unstructured":"Goldman, S., & Scott, S. (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\u2013199). San Francisco, CA: Morgan Kaufmann."},{"key":"237029_CR16","doi-asserted-by":"crossref","unstructured":"Gruber, P. M. (1983). Approximation of convex bodies. In P. M. Gruber & J. M. Willis (Eds.), Convexity and its applications. Brikh\u00e4user Verlag.","DOI":"10.1007\/978-3-0348-5858-8_7"},{"issue":"2","key":"237029_CR17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0890-5401(91)90042-Z","volume":"95","author":"D. Haussler","year":"1991","unstructured":"Haussler, D., Kearns, M., Littlestone, N., & Warmuth, M. K. (1991). Equivalence of models for polynomial learnability. Information and Computation, 95(2), 129\u2013161.","journal-title":"Information and Computation"},{"issue":"2","key":"237029_CR18","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1006\/inco.1994.1097","volume":"115","author":"D. Haussler","year":"1994","unstructured":"Haussler, D., Littlestone, N., & Warmuth, M. K. (1994). Predicting {0; 1} functions on randomly drawn points. Information and Computation, 115(2), 284\u2013293.","journal-title":"Information and Computation"},{"issue":"1","key":"237029_CR19","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/37.120451","volume":"12","author":"J. Hong","year":"1992","unstructured":"Hong, J., Tan, X., Pinette, B., Weiss, R., & Riseman, E. M. (1992). Image-based homing. IEEE Control Systems Magazine, 12(1), 38\u201345.","journal-title":"IEEE Control Systems Magazine"},{"key":"237029_CR20","first-page":"392","volume-title":"Proceedings of the 25th Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1993","unstructured":"Kearns, M. (1993). Efficient noise-tolerant learning from statistical queries. Proceedings of the 25th Annual ACM Symposium on Theory of Computing (pp. 392\u2013401). New York, NY: ACM Press."},{"issue":"3","key":"237029_CR21","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/S0022-0000(05)80062-5","volume":"48","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., & Schapire, R. (1994). Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48(3), 464\u2013497.","journal-title":"Journal of Computer and System Sciences"},{"key":"237029_CR22","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":"Kearns, M., & Vazirani, U. (1994). An introduction to computational learning theory. Cambridge, MA: MIT Press."},{"issue":"3","key":"237029_CR23","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0004-3702(90)90027-W","volume":"44","author":"T. S. Levitt","year":"1990","unstructured":"Levitt, T. S., & Lawton, D. T. (1990). Qualitative navigation for mobile robots. Artificial Intelligence, 44(3), 305\u2013360.","journal-title":"Artificial Intelligence"},{"key":"237029_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285\u2013318.","journal-title":"Machine Learning"},{"key":"237029_CR25","volume-title":"Machine learning: A theoretical approach","author":"B. K. Natarajan","year":"1991","unstructured":"Natarajan, B. K. (1991). Machine learning: A theoretical approach. San Francisco, CA: Morgan Kaufmann Publishers."},{"key":"237029_CR26","volume-title":"Image-based navigation through large-scaled environments","author":"B. Pinette","year":"1993","unstructured":"Pinette, B. (1993). Image-based navigation through large-scaled environments. Ph.D. thesis, University of Massachusetts, Amherst."},{"key":"237029_CR27","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"Pitt, L., & Valiant, L. (1988). Computational limitations on learning from examples. Journal of the ACM, 35, 965\u2013984.","journal-title":"Journal of the ACM"},{"issue":"3","key":"237029_CR28","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","volume":"41","author":"L. Pitt","year":"1990","unstructured":"Pitt, L., & Warmuth, M. K. (1990). Prediction preserving reducibility. Journal of Computer and System Sciences, 41(3), 430\u2013467. Special issue of the Third Annual Conference of Structure in Complexity Theory (Washington, DC., June 1988).","journal-title":"Journal of Computer and System Sciences"},{"issue":"5","key":"237029_CR29","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/rob.4620050505","volume":"5","author":"H. Suzuki","year":"1988","unstructured":"Suzuki, H., & Arimoto, S. (1988). Visual control of autonomous mobile robot based on self-organizing model for pattern learning. Journal of Robotic Systems, 5(5), 453\u2013470.","journal-title":"Journal of Robotic Systems"},{"issue":"11","key":"237029_CR30","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(11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"237029_CR31","unstructured":"Valiant, L. G. (1985). Learning disjunctions of conjunctions. Proceedings of the 9th International Joint Conference on AI, 560\u2013566."},{"key":"237029_CR32","unstructured":"Valiant, L. (1991). A view of computational learning theory. Computation & Cognition: Proceedings of the First NEC Research Symposium, 32\u201351."},{"issue":"2","key":"237029_CR33","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(2), 264\u2013280.","journal-title":"Theory of Probability and its Applications"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007681724516.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007681724516\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007681724516.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:39:02Z","timestamp":1752147542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007681724516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["237029"],"URL":"https:\/\/doi.org\/10.1023\/a:1007681724516","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,10]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}