Consider the binary tree of Figure 2.1. This tree gives an algorithm for choosing a bad coin. Beginning at the root and choosing the appropriate edge, we arrive at a terminal vertex that chooses the bad coin. Such a tree is called a decision tree. In this section, we use decision trees to specify algorithms and to obtain lower bounds on the worst case time for sorting as well as solving certain coin problems.
KeywordsDecision Tree Decision Function Fuzzy Decision Young Brother Terminal Vertex
Unable to display preview. Download preview PDF.
- 4.Chang, R.L.P., Application of fuzzy decision techniques to pattern recognition and curve fitting, Ph.D thesis, Dept. of EECS, Princeton Univ., 1976.Google Scholar
- 8.Harary, F., Graph Theory, Addison Wesley, Reading, MA, 1971.Google Scholar
- 9.Knuth, D.E., The Art of Computer Programming, Vol.1, Addison Wesley, Reading, MA, 1969.Google Scholar
- 13.Siy, P. and Chen, C.S., Fuzzy logic approach to hand written character recognition problem, Proc. IEEE Conf. Systems, Man, Cybern., Anaheim, Calif., 1971, pp. 113–117.Google Scholar
- 15.Zadeh, L.A., A fuzzy-algorithimic approach to the definition of complex or imprecise concepts, Memorandum ERL-M474, Electronic Research Lab., College of Eng., U.C. Berkeley, 1974.Google Scholar