• DocumentCode
    2453955
  • Title

    Evaluation measures for learning probabilistic and possibilistic networks

  • Author

    Borgelt, Christian ; Kruse, Rudolf

  • Author_Institution
    Dept. of Inf. & Commun. Syst., Otto-von-Guericke Univ., Magdeburg, Germany
  • Volume
    2
  • fYear
    1997
  • fDate
    1-5 Jul 1997
  • Firstpage
    669
  • Abstract
    Evidence propagation in inference networks, probabilistic or possibilistic, can be done in two different ways - using a product/sum scheme or using a minimum/maximum scheme - depending on the type of answers one expects from the network. Usually the former is seen in connection with probabilistic reasoning, and the latter with possibilistic reasoning, although we argue that both schemes are applicable in both settings. The paper discusses learning inference networks from data and examines some evaluation measures with respect to the chosen propagation method
  • Keywords
    entropy; inference mechanisms; learning (artificial intelligence); minimax techniques; possibility theory; probability; uncertainty handling; entropy; evidence propagation; learning from data; learning inference networks; min-max scheme; possibilistic networks; possibilistic reasoning; probabilistic networks; product/sum scheme; Bayesian methods; Calculus; Context modeling; Inference algorithms; Markov random fields; Possibility theory; Propagation losses; Uncertainty; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fuzzy Systems, 1997., Proceedings of the Sixth IEEE International Conference on
  • Conference_Location
    Barcelona
  • Print_ISBN
    0-7803-3796-4
  • Type

    conf

  • DOI
    10.1109/FUZZY.1997.622792
  • Filename
    622792