A hybrid approach for learning parameters of probabilistic networks from incomplete databases

被引:0
|
作者
Haider, S [1 ]
机构
[1] George Mason Univ, Syst Architectures Lab, Fairfax, VA 22030 USA
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Probabilistic Inference Networks are becoming increasingly popular for modeling and reasoning in uncertain domains. In the past few years, many efforts have been made in learning the parameters of probabilistic network directly from databases. The learning techniques are based on the assumption that the database is complete. If there are missing values, these values are first estimated and then the modified database is used to learn the parameters of the network. During the estimation process, the missing values are assumed to be missing at random. This paper incorporates the concepts of the Dempster-Shafer theory of belief functions to learn the parameter of the inference network. Instead of filling the missing values by their estimates, we model these missing values as representing our ignorance or lack of belief in their state. The representation provides the possibility to obtain interval estimates of the marginal probabilities of each variable in the inference network. The representation also allows us to model evidence in terms of support functions as used in belief functions, thus providing a richer way to enter evidence or new findings in the probabilistic model.
引用
收藏
页码:321 / 330
页数:10
相关论文
共 50 条
  • [31] A Probabilistic Process Learning Approach for Service Composition in Cloud Networks
    Al Ridhawi, Ismaeel
    Kotb, Yehia
    Aloqaily, Moayad
    Kantarci, Burak
    2017 IEEE 30TH CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING (CCECE), 2017,
  • [32] Learning probabilistic networks
    Krause, PJ
    KNOWLEDGE ENGINEERING REVIEW, 1998, 13 (04): : 321 - 351
  • [33] Learning the Parameters of Probabilistic Logic Programs from Interpretations
    Gutmann, Bernd
    Thon, Ingo
    De Raedt, Luc
    MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES, PT I, 2011, 6911 : 581 - 596
  • [34] An experimental comparison of methods for handling incomplete data in learning parameters of Bayesian networks
    Onisko, A
    Druzdzel, MJ
    Wasyluk, H
    INTELLIGENT INFORMATION SYSTEMS 2002, PROCEEDINGS, 2002, 17 : 351 - 360
  • [35] Reinforcement learning approach for robustness analysis of complex networks with incomplete information
    Tian, Meng
    Dong, Zhengcheng
    Wang, Xianpei
    CHAOS SOLITONS & FRACTALS, 2021, 144
  • [36] PROBABILISTIC APPROACH TO NETWORKS
    RAPOPORT, A
    SOCIAL NETWORKS, 1979, 2 (01) : 1 - 18
  • [37] A heuristic approach to learning rules from fuzzy databases
    Ranilla, Jose
    Rodriguez-Muniz, Luis J.
    IEEE INTELLIGENT SYSTEMS, 2007, 22 (02) : 62 - 68
  • [38] ONE APPROACH TO THE NEGATION AS FAILURE MECHANISM FOR INCOMPLETE DATABASES
    GELFOND, M
    PRZYMUSINSKA, H
    JOURNAL OF SYMBOLIC LOGIC, 1986, 51 (03) : 843 - 843
  • [39] A guide to the literature on learning probabilistic networks from data
    Buntine, W
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1996, 8 (02) : 195 - 210
  • [40] Learning Bayesian networks structures from incomplete data: An efficient approach based on extended evolutionary programming
    Li, XL
    He, XD
    Yuan, SM
    ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PROCEEDINGS, 2005, 3518 : 474 - 479