{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T09:14:08Z","timestamp":1768986848075,"version":"3.49.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1982,7]]},"DOI":"10.1109\/tit.1982.1056522","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"565-577","source":"Crossref","is-referenced-by-count":82,"title":["Application of information theory to the construction of efficient decision trees"],"prefix":"10.1109","volume":"28","author":[{"given":"C.","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Varshney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Gerberich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref5b","first-page":"742","volume":"14","year":"1967","journal-title":"II Minimum storage requirement"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675963"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(76)90095-8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/322017.322023"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/358855.358863"},{"key":"ref30","author":"yasui","year":"1972","journal-title":"Conversion of Decision Tables into Decision Trees"},{"key":"ref37","author":"billingsley","year":"1965","journal-title":"Ergodic Theoiy and Information"},{"key":"ref36","volume":"i","author":"knuth","year":"1975","journal-title":"The art of computer programming"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2307\/2982129"},{"key":"ref34","author":"picard","year":"1980","journal-title":"Graphes et Questionnaires"},{"key":"ref10","first-page":"69","article-title":"Conversion of limited entry decision tables to computer programs?A proposed modification to Pollack's algorithm","volume":"14","author":"shwayder","year":"1971","journal-title":"Commun Ass Comput Mach"},{"key":"ref11","author":"ganapathy","year":"1969","journal-title":"M Tech Th"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/365876.365896"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362390"},{"key":"ref14","author":"ibramshah","year":"1971","journal-title":"A fast rule mask algorithm for the conversion of decision tables to computer programs"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/363707.363725"},{"key":"ref16","first-page":"532","article-title":"Extending the information theory approach to converting limited-entry decision tables to computer programs","volume":"17","author":"shwayder","year":"1974","journal-title":"Commun Ass Comput Mach"},{"key":"ref17","author":"goel","year":"1978","journal-title":"Random test generation for fault detection and diagnosis"},{"key":"ref18","article-title":"An information-theoretic approach to data-processing algorithms","author":"massey","year":"1974","journal-title":"1974 IEEE Int Symp Inform Theory"},{"key":"ref19","author":"massey","year":"1976","journal-title":"Topics in discrete information processing"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/360238.360245"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/953368.953377"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/0123019"},{"key":"ref28a","author":"faria","year":"1980","journal-title":"An information theoretic approach to the construction of efficient decision trees"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1147\/sj.11.0051"},{"key":"ref29","author":"michalski","year":"1978","journal-title":"Designing extended entry decision tables and optimal decision trees using decision diagrams"},{"key":"ref28b","year":"1981","journal-title":"1981 IEEE Int Symp Inform Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/365660.365681"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/367593.367595"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/10.2.135"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/355606.361883"},{"key":"ref22","author":"alster","year":"1971","journal-title":"Heuristic algorithms for construction near-optimal decision trees"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362348"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/365153.365163"},{"key":"ref23","first-page":"77","article-title":"A dynamic programming algorithm to optimise decision table code","volume":"4","author":"bayes","year":"1973","journal-title":"Australian Comput J"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/356628.356630"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/953368.953372"},{"key":"ref5a","doi-asserted-by":"publisher","DOI":"10.1145\/321341.321343"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22727\/01056522.pdf?arnumber=1056522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:58:39Z","timestamp":1752775119000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056522\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":40,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.1982.1056522","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,7]]}}}