{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T05:56:11Z","timestamp":1784872571949,"version":"3.55.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8904,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1016\/0890-5401(89)90010-2","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"227-248","source":"Crossref","is-referenced-by-count":403,"title":["Inferring decision trees using the minimum description lenght principle"],"prefix":"10.1016","volume":"80","author":[{"given":"J.","family":"Ross Quinlan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ronald L.","family":"Rivest","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0890-5401(89)90010-2_BIB1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1093\/comjnl\/16.3.254","article-title":"An information measure for hierarchic classification","volume":"16","author":"Boulton","year":"1973","journal-title":"Comput. J."},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90010-2_BIB2","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1093\/comjnl\/18.3.236","article-title":"An information measure for single-link classification","volume":"18","author":"Boulton","year":"1973","journal-title":"Comput. J."},{"key":"10.1016\/0890-5401(89)90010-2_BIB3","author":"Breiman","year":"1984"},{"key":"10.1016\/0890-5401(89)90010-2_BIB4","series-title":"ECAI 84: Advances in Artificial Intelligence","first-page":"473","article-title":"A general selection criterion for inductive inference","author":"Georgeff","year":"1984"},{"key":"10.1016\/0890-5401(89)90010-2_BIB5","article-title":"Minimum Information Estimation of Structure","author":"Hart","year":"1987"},{"issue":"No. 1","key":"10.1016\/0890-5401(89)90010-2_BIB6","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","article-title":"Constructing optimal binary decision trees is NP-complete","volume":"5","author":"Hyafil","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(89)90010-2_BIB7","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0890-5401(89)90010-2_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","author":"Quinlan","year":"1986","journal-title":"Mach. Learning"},{"key":"10.1016\/0890-5401(89)90010-2_BIB9","doi-asserted-by":"crossref","DOI":"10.1016\/S0020-7373(87)80053-6","article-title":"Simplifying decision trees","author":"Quinlan","year":"1987","journal-title":"Internat. J. Man Mach. Stud."},{"key":"10.1016\/0890-5401(89)90010-2_BIB10","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","article-title":"Modeling by shortest data description","volume":"14","author":"Rissanen","year":"1978","journal-title":"Automatica"},{"issue":"No. 3","key":"10.1016\/0890-5401(89)90010-2_BIB11","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1214\/aos\/1176350051","article-title":"Stochastic complexity and modeling","volume":"14","author":"Rissanen","year":"1986","journal-title":"Ann. of Statist."},{"key":"10.1016\/0890-5401(89)90010-2_BIB12","author":"Rissanen","year":"1986"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90010-2_BIB13","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346150","article-title":"A universal prior for integers and estimation by minimum description lenght","volume":"11","author":"Rissanen","year":"1983","journal-title":"Ann. of Statist"},{"issue":"No. 1","key":"10.1016\/0890-5401(89)90010-2_BIB14","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TIT.1981.1056282","article-title":"Universal modeling and coding","volume":"IT-27","author":"Rissanen","year":"1981","journal-title":"IEEE Trans. Infor. Theory"},{"issue":"No. 2","key":"10.1016\/0890-5401(89)90010-2_BIB15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","article-title":"An information measure for classification","volume":"11","author":"Wallace","year":"1968","journal-title":"Comput. J."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900102?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900102?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:27:29Z","timestamp":1549045649000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["0890540189900102"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90010-2","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}