.png){kind=icon}
返回
Constraint-based probabilistic modeling for statistical abduction
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-010-5206-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a new framework for logic-based probabilistic modeling called constraint-based probabilistic modeling which defines CBPMs (constraint-based probabilistic models) , i.e. conditional joint distributions P(a <...a KB) pound over independent propositional variables constrained by a knowledge base KB consisting of clauses. We first prove that generative models such as PCFGs and discriminative models such as CRFs have equivalent CBPMs as long as they are discrete. We then prove that CBPMs in infinite domains exist which give existentially closed logical consequences of KB probability one. Finally we derive an EM algorithm for the parameter learning of CBPMs and apply it to statistical abduction.
Keyword:
Probabilistic model
Constraint
Abduction
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
分享收藏分享收藏分享收藏
Learning probabilistic logic models from probabilistic examples从概率示例中学习概率逻辑模型.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏分享收藏
查看更多内容