• DocumentCode
    291947
  • Title

    Decision trees from uncertain learning sets

  • Author

    Gabbert, Paula

  • Author_Institution
    Dept. of Math. & Comput. Sci., Wilkes Univ., Wilkes Barre, PA, USA
  • Volume
    1
  • fYear
    1994
  • fDate
    2-5 Oct 1994
  • Firstpage
    913
  • Abstract
    Decision trees are structures which form a partition of some given measurement space for the purpose of classifying new measurements. Typically, the construction of the decision tree is performed using a learning set (or training set) where the class of each observation is certain. An uncertain learning set is a collection of measurements and probability masses over the set of classes for each measurement. The uncertainty in the learning set affects several of the results on decision trees previously presented in the literature. This paper suggests several new splitting criteria for constructing trees using uncertain learning sets. Additional extensions are provided for developing new misclassification estimates and test sample estimates for the decision tree. Finally, an application of these techniques in sensor fusion is outlined
  • Keywords
    decision theory; learning (artificial intelligence); probability; sensor fusion; trees (mathematics); uncertainty handling; decision trees; probability trees; sensor fusion; splitting criteria; uncertain learning sets; Decision trees; Mean square error methods; Random variables; User-generated content;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics, 1994. Humans, Information and Technology., 1994 IEEE International Conference on
  • Conference_Location
    San Antonio, TX
  • Print_ISBN
    0-7803-2129-4
  • Type

    conf

  • DOI
    10.1109/ICSMC.1994.399953
  • Filename
    399953