Answers are grounded in this paper and cite their sources.
Certain theoretical aspects of fuzzy decision trees and their applications are discussed. The main result is a branch-bound-backtrack algorithm which, by means of pruning subtrees unlikely to be traversed and installing tree-traversal pointers, has an effective backtracking mechanism leading to the optimal solution while still requiring usually only O(log n) time, where n is the number of decision classes.
No takes yet. Share an insight, caveat, or question.
Chang et al. (1977) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: