Pragmatic problems of decision table optimization

Abstract

The conversion of a decision table into an optimal decision tree is an integral part of most decision table compilers. This thesis establishes some fundamental concepts of a heuristic approach to the conversion of limited entry decision tables into decision trees and proposes algorithms for the latter two objectives