The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The synthetic approach to decision table conversion
Communications of the ACM
Information theory applied to the conversion of decision tables to computer programs
Communications of the ACM
Use of decision tables in computer programming
Communications of the ACM
Conversion of limited-entry decision tables to computer programs
Communications of the ACM
Conversion of decision tables to computer programs by rule mask techniques
Communications of the ACM
A procedure for converting logic table conditions into an efficient sequence of test instructions
Communications of the ACM
ACM Computing Surveys (CSUR)
Communications of the ACM
Restructuring decision tables for elucidation of knowledge
Data & Knowledge Engineering
| Hi-index | 48.23 |
Sequential testing procedures for checking the rule-applicability of the decision tables encountered in practice are usually found to be minimum-path-length trees. On the basis of this observation, an algorithm is developed for converting decision tables to efficient decision trees. A criterion is defined for estimating the minimum expected cost of the tree in terms of rule probabilities and condition-testing costs and is utilized in arriving at the efficient decision tree. The algorithm is applicable to general limited-entry decision tables and can also be employed for manual coding.