Fuzzy Decision Tree Algorithms
- 1 January 1977
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics
- Vol. 7 (1), 28-35
- https://doi.org/10.1109/tsmc.1977.4309586
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Computer Recognition of Handwritten Numerals by Polygonal ApproximationsIEEE Transactions on Systems, Man, and Cybernetics, 1975
- Outline of a New Approach to the Analysis of Complex Systems and Decision ProcessesIEEE Transactions on Systems, Man, and Cybernetics, 1973
- A note on fuzzy setsInformation and Control, 1971
- Optimum binary search treesActa Informatica, 1971
- Branch-and-Bound Methods: A SurveyOperations Research, 1966