Decision Trees

  • Davender S. Malik
  • John N. Mordeson
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 58)


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.


Decision Tree Decision Function Fuzzy Decision Young Brother Terminal Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adamo, J.H., Fuzzy decision trees, Fuzzy Sets and Systems, 4 (1980) 207–219.MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Aho, A.V., Hoperoft, J.E, and Ullman, J.D., The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.MATHGoogle Scholar
  3. 3.
    Brown, J.G., A note on fuzzy sets, Info. and Control, 18 (1971) 32–39.MATHCrossRefGoogle Scholar
  4. 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
  5. 5.
    Chang, R.L.P. and Pavlidis, T., Fuzzy decision tree algorithms, IEEE Trans. System Man Cybernet, 7 (1977) 20–35.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Duda, R.O. and Hart, P.E., Pattern Classification and Scene Analysis, Wiley, New York, 1973.MATHGoogle Scholar
  7. 7.
    Friedman, M., Bar-noy, T., Blau, M., and Kandel, A., Certain computational aspects of fuzzy decision trees, Fuzzy Sets and Systems, 28 (1988) 163–170.MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Harary, F., Graph Theory, Addison Wesley, Reading, MA, 1971.Google Scholar
  9. 9.
    Knuth, D.E., The Art of Computer Programming, Vol.1, Addison Wesley, Reading, MA, 1969.Google Scholar
  10. 10.
    Knuth, D.E., Optimum binary search trees, Acta Informatica, 1 (1971) 14–25.MATHCrossRefGoogle Scholar
  11. 11.
    Lawler, E.L. and Wood, D.E., Branch- and-bound methods: A survey, Operations Research, 14 (1966) 699–719.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Pavlidis, T. and Ali, F., Computer recognition of hand written numerals by polygonal approximations, IEEE Trans. Systems, Man, Cybern., 5 (1975) 610–614.MATHCrossRefGoogle Scholar
  13. 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
  14. 14.
    Zadeh, L.A., Outline of a new approach to the analysis of complex systems and decision processes, IEEE Trans. Systems, Man, Cybern., 3 (1973) 28–44.MathSciNetMATHCrossRefGoogle Scholar
  15. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Davender S. Malik
    • 1
  • John N. Mordeson
    • 1
  1. 1.Creighton UniversityOmahaUSA

Personalised recommendations