Misplaced Pages

Credal network

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Probabilistic graphical models based on imprecise probability
This article may be confusing or unclear to readers. Please help clarify the article. There might be a discussion about this on the talk page. (November 2022) (Learn how and when to remove this message)

Credal networks are probabilistic graphical models based on imprecise probability. Credal networks can be regarded as an extension of Bayesian networks, where credal sets replace probability mass functions in the specification of the local models for the network variables given their parents. As a Bayesian network defines a joint probability mass function over its variables, a credal network defines a joint credal set. The way this credal set is defined depends on the particular notion of independence for imprecise probability adopted. Most of the research on credal networks focused on the case of strong independence. Given strong independence the joint credal set associated to a credal network is called its strong extension. Let ( X 1 , … , X n ) {\displaystyle (X_{1},\ldots ,X_{n})} denote a collection of categorical variables and G {\displaystyle G} . If K ( X i ∣ π i ) {\displaystyle K(X_{i}\mid \pi _{i})} is, for each i = 1 , … , n {\displaystyle i=1,\ldots ,n} , a conditional credal set over X i {\displaystyle X_{i}} , then the strong extension of a credal network is defined as follows:

K ( X 1 , … , X n ) = C H { P ( X 1 , … , X n ) : P ( x 1 , … , x n ) = ∏ i = 1 n P ( x i ∣ π i ) , P ( X i ∣ π i ) ∈ K ( X i ∣ π i ) } {\displaystyle K(X_{1},\ldots ,X_{n})=\mathrm {CH} \{P(X_{1},\ldots ,X_{n}):P(x_{1},\ldots ,x_{n})=\prod _{i=1}^{n}P(x_{i}\mid \pi _{i}),P(X_{i}\mid \pi _{i})\in K(X_{i}\mid \pi _{i})\}}

where C H {\displaystyle \mathrm {CH} } denote the convex hull.

Inference

Inference on a credal network is intended as the computation of the bounds of an expectation with respect to its strong extensions. When computing the bounds of a conditional event, inference is called updating. Say that the queried variable X q {\displaystyle X_{q}} and the observed variables are X E {\displaystyle X_{E}} , the lower bound to be evaluated is:

P _ ( x q ∣ x E ) = min P ( X 1 , … , X n ) ∈ K ( X 1 , … , X n ) ∑ X q , X E P ( X 1 , … , X n ) ∑ X q P ( X 1 , … , X n ) . {\displaystyle {\underline {P}}(x_{q}\mid x_{E})=\min _{P(X_{1},\ldots ,X_{n})\in K(X_{1},\ldots ,X_{n})}{\frac {\sum _{X_{q},X_{E}}P(X_{1},\ldots ,X_{n})}{\sum _{X_{q}}P(X_{1},\ldots ,X_{n})}}.}

Being a generalization of the same problem for Bayesian networks, updating with credal networks is a NP-hard task. Yet a number of algorithm have been specified.

See also

References

  1. Ding, Song; Pan, Xing; Zuo, Dujun; Zhang, Wenjin; Sun, Liuwang (2022-02-01). "Uncertainty analysis of accident causality model using Credal Network with IDM method: A case study of hazardous material road transportation accidents". Process Safety and Environmental Protection. 158: 461–473. Bibcode:2022PSEP..158..461D. doi:10.1016/j.psep.2021.12.021. ISSN 0957-5820.

Further reading

  • Cozman, F.G., 2000. Credal networks. Artificial intelligence, 120(2), pp. 199–233.


Stub icon

This probability-related article is a stub. You can help Misplaced Pages by expanding it.

Categories: