avalanche_protection_in_davos_switzerland
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
avalanche_protection_in_davos_switzerland [2019/05/16 15:27] – [2. Quantifying the network (CPTs)] stritiha | avalanche_protection_in_davos_switzerland [2023/04/21 15:30] (current) – external edit 127.0.0.1 | ||
---|---|---|---|
Line 31: | Line 31: | ||
p(Crown_cover_Lidar | Crown_cover) = NormalDist(Crown_cover_Lidar, | p(Crown_cover_Lidar | Crown_cover) = NormalDist(Crown_cover_Lidar, | ||
| | ||
- | {{: | + | {{: |
// Distribution of actual crown cover, given a measurement of crown cover. The CPT of Crown cover (Lidar) is defined as a normal distribution around the actual crown cover.// | // Distribution of actual crown cover, given a measurement of crown cover. The CPT of Crown cover (Lidar) is defined as a normal distribution around the actual crown cover.// | ||
Line 42: | Line 42: | ||
However, this procedure results in a very large CPT for the node (a line for each combination of parameters and predictor variables). Since the parameter nodes will not be modified with evidence, we can reduce the CPT by using the function “Absorb nodes”, which removes the nodes from the network, but retains the associated information in the reduced CPT. | However, this procedure results in a very large CPT for the node (a line for each combination of parameters and predictor variables). Since the parameter nodes will not be modified with evidence, we can reduce the CPT by using the function “Absorb nodes”, which removes the nodes from the network, but retains the associated information in the reduced CPT. | ||
- | {{: | + | {{: |
//The parameters of an empirical model can be included explicitly as nodes in the network, to account for model uncertainty when calculating the CPT. Then, these nodes can be " | //The parameters of an empirical model can be included explicitly as nodes in the network, to account for model uncertainty when calculating the CPT. Then, these nodes can be " | ||
Line 56: | Line 56: | ||
For nodes where no data was available (e.g. “Potential detrainment”), | For nodes where no data was available (e.g. “Potential detrainment”), | ||
- | {{: | + | {{: |
// | // | ||
Line 69: | Line 69: | ||
The model and the resulting maps of avalanche protection provision and demand, as well as the underlying ecosystem functions, were presented and discussed with local experts. In addition, we performed a sensitivity analysis of the model, using the Netica function “Sensitivity to findings” to calculate the reduction of entropy (uncertainty) on the target nodes in response to findings on other nodes in the network. The entropy reduction (also called mutual information) gives us an indication of which variables in the system have the highest influence on the ecosystem service. | The model and the resulting maps of avalanche protection provision and demand, as well as the underlying ecosystem functions, were presented and discussed with local experts. In addition, we performed a sensitivity analysis of the model, using the Netica function “Sensitivity to findings” to calculate the reduction of entropy (uncertainty) on the target nodes in response to findings on other nodes in the network. The entropy reduction (also called mutual information) gives us an indication of which variables in the system have the highest influence on the ecosystem service. | ||
- | We also performed a stepwise sensitivity analysis to visualize the flow of information in the network. For each node X, we calculated the proportion of its entropy that can be reduced by a finding on each of its parents. These relative mutual information values were used as weights for links between nodes in a Sankey diagram of the network (Figure 6.1-8) For each node, the thickness of incoming (from the left) links show how much the entropy on the node can be reduced by findings on preceding nodes. Mutual information is not additive, i.e. if both parent nodes can reduce the entropy of a child by 50%, this does not mean that findings on both parents will result in complete certainty on the child node. Nonetheless, | + | We also performed a stepwise sensitivity analysis to visualize the flow of information in the network. For each node X, we calculated the proportion of its entropy that can be reduced by a finding on each of its parents. These relative mutual information values were used as weights for links between nodes in a Sankey diagram of the network (see figure below). For each node, the thickness of incoming (from the left) links show how much the entropy on the node can be reduced by findings on preceding nodes. Mutual information is not additive, i.e. if both parent nodes can reduce the entropy of a child by 50%, this does not mean that findings on both parents will result in complete certainty on the child node. Nonetheless, |
{{: | {{: |
avalanche_protection_in_davos_switzerland.1558013243.txt.gz · Last modified: 2023/04/21 15:30 (external edit)