.png){kind=icon}
返回
Learning posisibilistic graphical models from data
.png){kind=icon}
OA
AI
DOI：10.1109/TFUZZ.2003.809887.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graphical models-especially probabilistic networks like Bayes networks and Markov networks-are very popular,to make reasoning in high-dimensional domains feasible. Since constructing them. manually can be tedious and time consuming, a large part of recent research has been devoted to learning them from data. However, if the dataset to learn from contains imprecise information in the form of sets of alternatives instead of precise values, this learning task can pose unpleasant problems. In this paper, we survey an approach to cope with these problems, which is not based on probability theory as the,more common approaches like, e.g:, expectation maximization, but uses possibility theory as the underlying calculus of a graphical model. We provide semantical foundations of possibilistic graphical models, explain the rationale of possibilistic decomposition as well as the graphical representation of decompositions of possibility distributions and finally discuss the main approaches, to learn possibilistic graphical models from data.
Keyword:
context model
learning from data
possibilistic networks
possibility theory
probabilistic networks
期刊
IF:
11.9
论文数:
5.0K
被引数:
2.9W
机构
暂无机构信息
引用论文
.png){kind=icon}
Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性
OAAI
OAAI分享收藏
查看更多内容