Home → Magazine Archive → May 1980 (Vol. 23, No. 5) → Conversion of decision tables to efficient sequential... → Abstract

Conversion of decision tables to efficient sequential testing procedures

By I. K. Sethi, B. Chatterjee

Communications of the ACM, Vol. 23 No. 5, Pages 279-285
10.1145/358855.358863


Save PDF
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.

The full text of this article is premium content

0 Comments

No entries found