{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:10:03Z","timestamp":1747548603987,"version":"3.40.5"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1023\/a:1018948021083","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"43-45","source":"Crossref","is-referenced-by-count":0,"title":["Remarks on computational learning theory"],"prefix":"10.1007","volume":"28","author":[{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"D. Angluin, Computational learning theory: Survey and selected bibliography, in: Proc. of 24th Symposium on Theory of Computing (STOC) (1992) pp. 351-369.","key":"325558_CR1","DOI":"10.1145\/129712.129746"},{"key":"325558_CR2","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"D. Angluin, M. Frazier and L. Pitt, Learning conjunctions of Horn clauses, Machine Learning 9 (1992) 147-164.","journal-title":"Machine Learning"},{"key":"325558_CR3","volume-title":"Computational Learning Theory: An Introduction","author":"M. Anthony","year":"1992","unstructured":"M. Anthony and N. Biggs, Computational Learning Theory: An Introduction (Cambridge University Press, Cambridge, England, 1992)."},{"key":"325558_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/inco.1995.1164","volume":"123","author":"N.H. Bshouty","year":"1995","unstructured":"N.H. Bshouty, Exact learning via the monotone theory, Inform. Comput. 123 (1995) 146-153.","journal-title":"Inform. Comput."},{"key":"325558_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Y. Freund and R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting, J. Comput. Systems Sci. 55 (1997) 119-139.","journal-title":"J. Comput. Systems Sci."},{"key":"325558_CR6","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1006\/jcss.1997.1533","volume":"55","author":"J.C. Jackson","year":"1997","unstructured":"J.C. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, J. Comput. Systems Sci. 55 (1997) 414-440.","journal-title":"J. Comput. Systems Sci."},{"key":"325558_CR7","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"M. Kearns","year":"1998","unstructured":"M. Kearns, Efficient noise-tolerant learning from statistical queries, J. ACM 45 (1998) 983-1006.","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"M.J. Kearns and Y. Mansour, On the boosting ability of top-down decision tree learning algorithms, in: Proc. of 28th Symposium on Theory of Computing (STOC) (1996) pp. 459-468.","key":"325558_CR8","DOI":"10.1145\/237814.237994"},{"key":"325558_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M.J. Kearns","year":"1994","unstructured":"M.J. Kearns and U.V. Vazirani, An Introduction to Computational Learning Theory (MIT Press, Cambridge, MA, 1994)."},{"key":"325558_CR10","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1145\/265910.265918","volume":"44","author":"R. Khardon","year":"1997","unstructured":"R. Khardon and D. Roth, Learning to reason, J. ACM 44 (1997) 697-725.","journal-title":"J. ACM"},{"key":"325558_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"N. Littlestone and M.K. Warmuth, The weighted majority algorithm, Inform. Comput. 108 (1994) 212-261.","journal-title":"Inform. Comput."},{"doi-asserted-by":"crossref","unstructured":"Y. Mansour, Reinforcement learning and mistake-bounded algorithms, in: Proc. of 12th Conf. on Computing and Learning Theory (COLT) (1999) pp. 183-192.","key":"325558_CR12","DOI":"10.1145\/307400.307437"},{"key":"325558_CR13","volume-title":"Machine Learning","author":"T.M. Mitchell","year":"1997","unstructured":"T.M. Mitchell, Machine Learning (McGraw-Hill, New York, 1997)."},{"key":"325558_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/319382.319388","volume":"42","author":"T.M. Mitchell","year":"1999","unstructured":"T.M. Mitchell, Machine learning and data mining, Comm. ACM 42 (1999) 31-36.","journal-title":"Comm. ACM"},{"key":"325558_CR15","volume-title":"Machine Learning: a Theoretical Approach","author":"B.K. Natarajan","year":"1991","unstructured":"B.K. Natarajan, Machine Learning: a Theoretical Approach (Morgan Kaufmann, San Mateo, CA, 1991)."},{"key":"325558_CR16","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"L. Valiant, A theory of the learnable, Comm. ACM 27 (1984) 1134-1142.","journal-title":"Comm. ACM"},{"key":"325558_CR17","volume-title":"Statistical Learning Theory","author":"V.N. Vapnik","year":"1998","unstructured":"V.N. Vapnik, Statistical Learning Theory (Wiley, New York, 1998)."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018948021083.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018948021083\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018948021083.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:33:49Z","timestamp":1747546429000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018948021083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":17,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["325558"],"URL":"https:\/\/doi.org\/10.1023\/a:1018948021083","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}