{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:45Z","timestamp":1773656385096,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"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":[[1987,11]]},"DOI":"10.1007\/bf00058680","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T01:58:04Z","timestamp":1099187884000},"page":"229-246","source":"Crossref","is-referenced-by-count":242,"title":["Learning decision lists"],"prefix":"10.1007","volume":"2","author":[{"given":"Ronald L.","family":"Rivest","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (pp. 273?282). Berkeley, CA.","DOI":"10.1145\/12130.12158"},{"key":"CR2","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, 377?380.","journal-title":"Information Processing Letters"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987). On the learnability of Boolean formulae. Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 285?295). New York, NY.","DOI":"10.1145\/28395.28426"},{"key":"CR4","volume-title":"Some NP-complete set-covering problems. Unpublished manuscript","author":"W. Masek","year":"1976","unstructured":"Masek, W. (1976). Some NP-complete set-covering problems. Unpublished manuscript, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1080\/03081077808960690","volume":"4","author":"J. Pearl","year":"1978","unstructured":"Pearl, J. (1978). On the connection between the complexity and credibility of inferred models. Journal of General Systems, 4, 255?264.","journal-title":"Journal of General Systems"},{"key":"CR6","series-title":"Technical Report","volume-title":"Computational limitations on learning from examples","author":"L. Pitt","year":"1986","unstructured":"Pitt, L., & Valiant, L. G. (1986). Computational limitations on learning from examples (Technical Report). Cambridge, MA: Harvard University, Aiken Computation Laboratory."},{"key":"CR7","first-page":"81","volume":"1","author":"J. R. Quinlan","year":"1986","unstructured":"Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1, 81?106.","journal-title":"Machine Learning"},{"key":"CR8","first-page":"304","volume-title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence","author":"J. R. Quinlan","year":"1987","unstructured":"Quinlan, J. R. (1987). Generating production rules from decision trees. Proceedings of the Tenth International Joint Conference on Artificial Intelligence (pp. 304?307). Milan, Italy: Morgan Kaufmann."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"Rissanen, J. (1978). Modeling by shortest data description. Automatica, 14, 465?471.","journal-title":"Automatica"},{"key":"CR10","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, 1134?1142.","journal-title":"Communications of the ACM"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00058680.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00058680\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00058680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T14:08:58Z","timestamp":1554732538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00058680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["BF00058680"],"URL":"https:\/\/doi.org\/10.1007\/bf00058680","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}