Most probable explanations in Bayesian networks: complexity and tractability (Q433524)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6053264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Most probable explanations in Bayesian networks: complexity and tractability |
scientific article; zbMATH DE number 6053264 |
Statements
Most probable explanations in Bayesian networks: complexity and tractability (English)
0 references
5 July 2012
0 references
Bayesian networks
0 references
most probable explanation
0 references
computational complexity
0 references
approximation
0 references
fixed parameter tractability
0 references
0.95346165
0 references
0 references
0.9398196
0 references
0.93587303
0 references
0.91650665
0 references
0.9117781
0 references
0.8978156
0 references
0.8938123
0 references
