{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:30:34Z","timestamp":1758274234329,"version":"3.41.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1023\/a:1022605628675","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T16:55:36Z","timestamp":1049475336000},"page":"271-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Power of Self-Directed Learning"],"prefix":"10.1007","volume":"14","author":[{"given":"Sally A.","family":"Goldman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert H.","family":"Sloan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"422442_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1022821128753","volume":"2","author":"Dana. Angluin","year":"1988","unstructured":"Angluin, Dana. (1988). Queries and concept learning. Machine Learning, 2 (4), 319\u2013342.","journal-title":"Machine Learning"},{"issue":"4","key":"422442_CR2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"Anselm Blumer","year":"1989","unstructured":"Blumer, Anselm, Ehrenfeucht, Andrzeg, Haussler, David, & Warmuth, Manfred K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the Association for Computing Machinery, 36 (4), 929\u2013965.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"422442_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0004-3702(85)90052-9","volume":"27","author":"A. Bundy","year":"1985","unstructured":"Bundy, A., Silver, B., & Plummer, D. (1985). An analytical comparison of some rule-learning programs. Artificial Intelligence, 27, 137\u2013181.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"422442_CR4","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0890-5401(89)90001-1","volume":"82","author":"Andrzej Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, Andrzej, & Haussler, David. (1989). Learning decision trees from random examples. Information and Computation, 82 (3), 231\u2013246.","journal-title":"Information and Computation"},{"key":"422442_CR5","doi-asserted-by":"crossref","unstructured":"Floyd, Sally. (1989). On space-bounded learning and the Vapnik-Chervonenkis dimension. Ph.D. thesis, International Computer Science Institute, Berkeley, CA.","DOI":"10.1016\/B978-0-08-094829-4.50028-3"},{"issue":"5","key":"422442_CR6","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1137\/0222062","volume":"22","author":"Sally A. Goldman","year":"1993","unstructured":"Goldman, Sally A., Rivest, Ronald L., & Schapire, Robert E. (1993). Learning binary relations and total orders. SIAM Journal on Computing, 22 (5), 1006\u20131034.","journal-title":"SIAM Journal on Computing"},{"key":"422442_CR7","series-title":"Technical Report","volume-title":"Learning conjunctive concepts in structural domains","author":"David. Haussler","year":"1987","unstructured":"Haussler, David. (1987). Learning conjunctive concepts in structural domains (Technical Report UCSC-CRL-87-1). Santa Cruz, CA: Computer Research Laboratory, University of Santa Cruz."},{"key":"422442_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","volume":"36","author":"David. Haussler","year":"1988","unstructured":"Haussler, David. (1988). Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. Artificial Intelligence, 36, 177\u2013221.","journal-title":"Artificial Intelligence"},{"key":"422442_CR9","first-page":"100","volume-title":"29th Annual Symposium on Foundations of Computer Science","author":"David Haussler","year":"1988","unstructured":"Haussler, David, Littlestone, Nick, & Warmuth, Manfred K. (1988). Predicting {0, 1}-functions on randomly drawn points. In 29th Annual Symposium on Foundations of Computer Science, White Plains, NY (pp. 100\u2013109), IEEE Computer Society Press: Los Alamitos, CA."},{"key":"422442_CR10","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1022696716689","volume":"5","author":"David Helmbold","year":"1990","unstructured":"Helmbold, David, Sloan, Robert, & Warmuth, Manfred K. (1990). Learning nested differences of intersectionclosed concept classes. Machine Learning, 5, 165\u2013196. Special issue for COLT 89.","journal-title":"Machine Learning"},{"issue":"2","key":"422442_CR11","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/0221019","volume":"21","author":"David Helmbold","year":"1992","unstructured":"Helmbold, David, Sloan, Robert, & Warmuth, Manfred K. (1992). Learning integer lattices. SIAM Journal on Computing, 21 (2), 240\u2013266.","journal-title":"SIAM Journal on Computing"},{"key":"422442_CR12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"Nick. Littlestone","year":"1988","unstructured":"Littlestone, Nick. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285\u2013318.","journal-title":"Machine Learning"},{"key":"422442_CR13","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/SFCS.1989.63488","volume-title":"30th Annual Symposium on Foundations of Computer Science","author":"Wolfgang Maass","year":"1989","unstructured":"Maass, Wolfgang, & Tur\u00e1n, Gy\u00f6rgy. (1989). On the complexity of learning from counterexamples. In 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, NC (pp. 262\u2013267), IEEE Computer Society Press: Los Alamitos, CA."},{"key":"422442_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1022637031594","volume":"9","author":"Wolfgang Maass","year":"1992","unstructured":"Maass, Wolfgang, & Tur\u00e1n, Gy\u00f6rgy. (1992). Lower bound methods and separation results for on-line learning models. Machine Learning, 9, 107\u2013145.","journal-title":"Machine Learning"},{"key":"422442_CR15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","volume":"18","author":"Thomas M. Mitchell","year":"1982","unstructured":"Mitchell, Thomas M. (1982). Generalization as search. Artificial Intelligence, 18, 203\u2013226.","journal-title":"Artificial Intelligence"},{"key":"422442_CR16","unstructured":"Rivest, Ronald L., & Sloan, Robert (In press). A formal model of hierarchical concept learning. Information and Computation."},{"key":"422442_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"A. Sauer","year":"1972","unstructured":"Sauer, A. (1972). On the density of families of sets. Journal of Combinatorial Theory (A), 13, 145\u2013147.","journal-title":"Journal of Combinatorial Theory (A)"},{"issue":"11","key":"422442_CR18","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"Leslie. Valiant","year":"1984","unstructured":"Valiant, Leslie. (1984). A theory of the learnable. Communications of the ACM, 27 (11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"issue":"2","key":"422442_CR19","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","volume":"XVI","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, XVI (2), 264\u2013280.","journal-title":"Theory of Probability and Its Applications"},{"key":"422442_CR20","unstructured":"Welzl. E. (1987). Complete range spaces. Unpublished manuscript."},{"key":"422442_CR21","unstructured":"Welzl, E., & Woeginger, G. (1986). On Vapnik-Chervonenkis dimension one. Unpublished manuscript."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022605628675.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022605628675\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022605628675.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:45:29Z","timestamp":1752147929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022605628675"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["422442"],"URL":"https:\/\/doi.org\/10.1023\/a:1022605628675","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[1994,3]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}