Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Art Lew (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: