# Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative

@inproceedings{Kwisthout2013MostIE, title={Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative}, author={Johan Kwisthout}, booktitle={ECSQARU}, year={2013} }

- Published in ECSQARU 2013
DOI:10.1007/978-3-642-39091-3_28

The problems of generating candidate hypotheses and inferring the best hypothesis out of this set are typically seen as two distinct aspects of the more general problem of non-demonstrative inference or abduction. In the context of Bayesian networks the latter problem (computing most probable explanations) is well understood, while the former problem is typically left as an exercise to the modeler. In other words, the candidate hypotheses are pre-selected and hard-coded. In reality, however… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-4 OF 4 CITATIONS

## Constraint-Based Querying for Bayesian Network Exploration

VIEW 2 EXCERPTS

CITES METHODS & BACKGROUND

## Most frugal explanations in Bayesian networks

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 26 REFERENCES

## The Computational Complexity of Probabilistic Networks

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Most probable explanations in Bayesian networks: Complexity and tractability

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Modeling and Reasoning with Bayesian Networks

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## New Complexity Results for MAP in Bayesian Networks

VIEW 3 EXCERPTS

## F

VIEW 2 EXCERPTS

#### Similar Papers

Loading similar papers…