Optimal conversion of extended-entry decision tables with general cost criteria

  • Authors:
  • Art Lew

  • Affiliations:
  • Univ. of Hawaii, Honolulu, HI

  • Venue:
  • Communications of the ACM
  • Year:
  • 1978

Quantified Score

Hi-index 48.25

Visualization

Abstract

A general dynamic programming algorithm for converting limited, extended, or mixed entry decision tables to optimal decision trees is presented which can take into account rule frequencies or probabilities, minimum time and/or space cost criteria, common action sets, compressed rules and ELSE rules, sequencing constraints on condition tests, excludable combinations of conditions, certain ambiguities, and interrupted rule masking.