1998
DOI: 10.1007/bfb0095287
|View full text |Cite
|
Sign up to set email alerts
|

Using mutual information to determine relevance in Bayesian networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

1999
1999
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(15 citation statements)
references
References 4 publications
0
15
0
Order By: Relevance
“…MI (Mutual Information) would be used for sensitivity analysis. MI is a measure of the dependence between two random variables and is more suitable for Bayesian network to sensitivity analysis (Nicholson & Jitnah 1998 …”
Section: P(d | S Hmentioning
confidence: 99%
“…MI (Mutual Information) would be used for sensitivity analysis. MI is a measure of the dependence between two random variables and is more suitable for Bayesian network to sensitivity analysis (Nicholson & Jitnah 1998 …”
Section: P(d | S Hmentioning
confidence: 99%
“…Nicholson and Jitnah [15] and later Ebert-Uphoff [16,17] used mutual information as the basis of the measure of link strength. Lacave [18] proposed a measure of link strength for the purpose of explanation in decision support systems based on Bayesian networks.…”
Section: Measures Of Bayesian Network Arc Strengthmentioning
confidence: 99%
“…These measures were first introduced by Boerlag [42] for Bayesian networks with binary nodes (two states). The Connection Strength (CS) measures the strength between any two nodes in the network (without accounting for the path between the two) whereas Link Strength (LS) (also referred to as arc weight [43]) specifically calculates the strength along a particular link between two adjacent nodes.…”
Section: Strength Of Relationship Between Nodesmentioning
confidence: 99%
“…Both these ideas were introduced initially as a way to improve the visualization of the network structure when learned from data (e.g., using thicker links to represent stronger relationships) but were also later used to improve the efficiency of inferencing algorithms (e.g., by eliminating links with insignificant weights) [43,44]. CS and LS are based on information theory concepts of entropy and mutual information.…”
Section: Strength Of Relationship Between Nodesmentioning
confidence: 99%
See 1 more Smart Citation