{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:35:44Z","timestamp":1757615744323,"version":"3.44.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T00:00:00Z","timestamp":1116460800000},"content-version":"vor","delay-in-days":5221,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0020-0255(91)90039-w","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T13:28:37Z","timestamp":1056979717000},"page":"251-270","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A binary decision algorithm"],"prefix":"10.1016","volume":"53","author":[{"given":"Sami","family":"Khuri","sequence":"first","affiliation":[]},{"given":"Aida","family":"Batarekh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1965","series-title":"Information Theory","author":"Ash","key":"10.1016\/0020-0255(91)90039-W_BIB1"},{"year":"1968","series-title":"Information Theory and Reliable Communication","author":"Gallager","key":"10.1016\/0020-0255(91)90039-W_BIB2"},{"key":"10.1016\/0020-0255(91)90039-W_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1137\/0123019","article-title":"Optimal binary identification procedures","volume":"23","author":"Garey","year":"1972","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"10.1016\/0020-0255(91)90039-W_BIB4","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1109\/TIT.1982.1056522","article-title":"Application of information theory to the construction of efficient decision trees","volume":"IT-28","author":"Hartmann","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"article-title":"La Construction des Cl\u00e9s de Diagnostic","year":"1974","author":"Hung","key":"10.1016\/0020-0255(91)90039-W_BIB5"},{"year":"1979","series-title":"Elementary Information Theory","author":"Jones","key":"10.1016\/0020-0255(91)90039-W_BIB6"},{"year":"1976","series-title":"Topics in Discrete Information Processing","author":"Massey","key":"10.1016\/0020-0255(91)90039-W_BIB7"},{"key":"10.1016\/0020-0255(91)90039-W_BIB8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/362515.362518","article-title":"Conversion of limited entry decision tables to computer programs\u2014a proposed modification to Pollack's algorithm","volume":"14","author":"Shwayder","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(91)90039-W_BIB9","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/361147.361117","article-title":"Extending the information theory approach to converting limited-entry decision tables to computer programs","volume":"17","author":"Shwayder","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(91)90039-W_BIB10","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/321341.321343","article-title":"Conversion of limited entry decision tables to optimal computer programs: Minimum average processing time","volume":"13","author":"Reinwald","year":"1966","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190039W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559190039W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:59:08Z","timestamp":1757084348000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559190039W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["002002559190039W"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(91)90039-w","relation":{},"ISSN":["0020-0255"],"issn-type":[{"type":"print","value":"0020-0255"}],"subject":[],"published":{"date-parts":[[1991,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A binary decision algorithm","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0255(91)90039-W","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}