<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The Impact of Overcon dence Bias on Practical Accuracy of Bayesian Network Models: An Empirical Study</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marek J. Druz_ dz_ el</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Agnieszka Onisko</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Decision Systems Laboratory, School of Information Sciences and Intelligent Systems Program, University of Pittsburgh</institution>
          ,
          <addr-line>Pittsburgh, PA 15260</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Faculty of Computer Science, Bialystok Technical University</institution>
          ,
          <addr-line>Wiejska 45A, 15-351 Bialystok</addr-line>
          ,
          <country country="PL">Poland</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Magee Womens Hospital, University of Pittsburgh Medical Center</institution>
          ,
          <addr-line>Pittsburgh, PA 15260</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2000</year>
      </pub-date>
      <abstract>
        <p>In this paper, we examine the in uence of overcon dence in parameter speci cation on the performance of a Bayesian network model in the context of Hepar II, a sizeable Bayesian network model for diagnosis of liver disorders. We enter noise in the parameters in such a way that the resulting distributions become biased toward extreme probabilities. We believe that this o ers a systematic way of modeling expert overcon dence in probability estimates. It appears that the diagnostic accuracy of Hepar II is less sensitive to overcon dence in probabilities than it is to undercon dence and to random noise, especially when noise is very large.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>INTRODUCTION</title>
      <p>
        Decision-analytic methods provide an orderly and
coherent framework for modeling and solving decision
problems in decision support systems [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. A
popular modeling tool for complex uncertain domains is a
Bayesian network [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], an acyclic directed graph
quanti ed by numerical parameters and modeling the
structure of a domain and the joint probability distribution
over its variables. There exist algorithms for
reasoning in Bayesian networks that typically compute the
posterior probability distribution over some variables
of interest given a set of observations. As these
algorithms are mathematically correct, the ultimate
quality of reasoning depends directly on the quality of the
underlying models and their parameters. These
parameters are rarely precise, as they are often based
on subjective estimates. Even when they are based
on data, they may not be directly applicable to the
decision model at hand and be fully trustworthy.
Search for those parameters whose values are critical
for the overall quality of decisions is known as
sensitivity analysis. Sensitivity analysis studies how much
a model output changes as various model parameters
vary through the range of their plausible values. It
allows to get insight into the nature of the problem
and its formalization, helps in re ning the model so
that it is simple and elegant (containing only those
factors that matter), and checks the need for precision
in re ning the numbers [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. It is theoretically
possible that small variations in a numerical parameter
cause large variations in the posterior probability of
interest. Van der Gaag and Renooij [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] found that
practical networks may indeed contain such
parameters. Because practical networks are often constructed
with only rough estimates of probabilities, a question
of practical importance is whether overall imprecision
in network parameters is important. If not, the e ort
that goes into polishing network parameters might not
be justi ed, unless it focuses on their small subset that
is shown to be critical.
      </p>
      <p>
        There is a popular belief, supported by some
anecdotal evidence, that Bayesian network models are overall
quite tolerant to imprecision in their numerical
parameters. Pradhan et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] tested this on a large
medical diagnostic model, the CPCS network [
        <xref ref-type="bibr" rid="ref16 ref7">7, 16</xref>
        ].
Their key experiment focused on systematic
introduction of noise in the original parameters (assumed to be
the gold standard) and measuring the in uence of the
magnitude of this noise on the average posterior
probability of the true diagnosis. They observed that this
average was fairly insensitive to even very large noise.
This experiment, while ingenious and thought
provoking, had two weaknesses. The rst of these, pointed
out by Coupe and van der Gaag [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], is that the
experiment focused on the average posterior rather than
individual posterior in each diagnostic case and how
it varies with noise, which is of most interest. The
second weakness is that the posterior of the correct
diagnosis is by itself not a su cient measure of model
robustness. The weaknesses of this experiment were
also discussed in [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. In our earlier work [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ],
we replicated the experiment of Pradhan et al. using
Hepar II, a sizeable Bayesian network model for
diagnosis of liver disorders. We systematically introduced
noise in Hepar II's probabilities and tested the
diagnostic accuracy of the resulting model. Similarly
to Pradhan et al., we assumed that the original set
of parameters and the model's performance are ideal.
Noise in the original parameters led to deterioration
in performance. The main result of our analysis was
that noise in numerical parameters started taking its
toll almost from the very beginning and not, as
suggested by Pradhan et al., only when it was very large.
The region of tolerance to noise, while noticeable, was
rather small. That study suggested that Bayesian
networks may be more sensitive to the quality of their
numerical parameters than popularly believed. Another
study that we conducted more recently [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] focused on
the in uence of progressive rounding of probabilities
on model accuracy. Here also, rounding had an
effect on the performance of Hepar II, although the
main source of performance loss were zero
probabilities. When zeros introduced by rounding are replaced
by very small non-zero values, imprecision resulting
from rounding has minimal impact on Hepar II's
performance.
      </p>
      <p>
        Empirical studies conducted so far that focused on the
impact of noise in probabilities on Bayesian network
results disagree in their conclusions. Also, the noise
introduced in parameters was usually assumed to be
random, which may not be a reasonable assumption.
Human experts, for example, often tend to be
overcon dent [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. This paper describes a follow-up study
that probes the issue of sensitivity of model accuracy
to noise in probabilities further. We examine whether
a bias in the noise that is introduced into the network
makes a di erence. We enter noise in the parameters
in such a way that the resulting distributions become
biased toward extreme probabilities. We believe that
this o ers a systematic way of modeling expert
overcon dence in probability estimates. Our results show
again that the diagnostic accuracy of Hepar II is
sensitive to imprecision in probabilities. It appears,
however, that the diagnostic accuracy of Hepar II is less
sensitive to overcon dence in probabilities than it is to
random noise. We also test the sensitivity of Hepar II
to undercon dence in parameters and show that
undercon dence in paramaters leads to more error than
random noise.
      </p>
      <p>The remainder of this paper is structured as follows.
Section 2 introduces the Hepar II model. Section 3
describes how we introduced noise into our
probabilities. Section 4 describes the results of our experiments.
Finally, Section 5 discusses our results in light of
previous work.</p>
    </sec>
    <sec id="sec-2">
      <title>THE Hepar II MODEL</title>
      <p>
        Our experiments are based on Hepar II [
        <xref ref-type="bibr" rid="ref10 ref11">10, 11</xref>
        ], a
Bayesian network model consisting of over 70
variables modeling the problem of diagnosis of liver
disorders. The model covers 11 di erent liver diseases
and 61 medical ndings, such as patient self-reported
data, signs, symptoms, and laboratory tests results.
The structure of the model, (i.e., the nodes of the
graph along with arcs among them) was built based
on medical literature and conversations with domain
experts and it consists of 121 arcs. Hepar II is a
real model and it consists of nodes that are a
mixture of propositional, graded, and general variables.
There are on the average 1.73 parents per node and
2.24 states per variable. The numerical parameters of
the model (there are 2,139 of these in the most recent
version), i.e., the prior and conditional probability
distributions, were learned from a database of 699 real
patient cases. Readers interested in the Hepar II model
can download it from Decision Systems Laboratory's
model repository at http://genie.sis.pitt.edu/.
As our experiments study the in uence of precision of
Hepar II's numerical parameters on its accuracy, we
owe the reader an explanation of the metric that we
used to test the latter. We focused on diagnostic
accuracy, which we de ned in our earlier publications as the
percentage of correct diagnoses on real patient cases.
When testing the diagnostic accuracy of Hepar II, we
were interested in both (1) whether the most probable
diagnosis indicated by the model is indeed the correct
diagnosis, and (2) whether the set of w most probable
diagnoses contains the correct diagnosis for small
values of w (we chose a \window" of w=1, 2, 3, and 4).
The latter focus is of interest in diagnostic settings,
where a decision support system only suggest
possible diagnoses to a physician. The physician, who is
the ultimate decision maker, may want to see several
alternative diagnoses before focusing on one.
With diagnostic accuracy de ned as above, the most
recent version of the Hepar II model reached the
diagnostic accuracy of 57%, 69%, 75%, and 79% for
window sizes of 1, 2, 3, and 4 respectively [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>INTRODUCTION OF NOISE</title>
    </sec>
    <sec id="sec-4">
      <title>INTO Hepar II PARAMETERS</title>
      <p>
        When introducing noise into parameters, we used
essentially the same approach as Pradhan et al. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
which is transforming each original probability into
log-odds function, adding noise parametrized by a
parameter (as we will show, even though is
proportional to the amount of noise, in our case it cannot be
directly interpreted as standard deviation), and
transNow, we designed the Noise() function as follows.
Given a discrete probability distribution Pr, we
identify the smallest probability pS . We transform this
smallest probability pS into p0S by making it even
smaller, according to the following formula:
p0S = Lo 1[Lo(pS )
jNormal(0; )j] :
We make the largest probability in the probability
distribution Pr, pL larger by precisely the amount by
which we decreased pS , i.e.,
p0L = pL + pS
p0S :
      </p>
      <p>
        Figure 1 shows the e ect of introducing the noise. As
we can see, the transformation is such that small
probabilities are likely to become smaller and large
probabilities are likely to become larger. Please note that
distributions have become more biased towards the
extreme probabilities. It is straightforward to prove that
the entropy of Pr0 is smaller than the entropy of Pr.
The transformed probability distributions re ect
overcon dence bias, common among human experts.
An alternative way of introducing biased noise,
suggested by one of the reviewers, is by means of
building a logistic regression/IRT model (e.g., [
        <xref ref-type="bibr" rid="ref1 ref15 ref2">1, 2, 15</xref>
        ])for
each conditional probability table and, subsequently,
manipulating the slope parameter.
3.2
      </p>
      <sec id="sec-4-1">
        <title>Undercon dence bias</title>
        <p>
          Now, we designed the Noise() function as follows.
Given a discrete probability distribution Pr, we
identify the highest probability pS . We transform this
largest probability pL into p0L by making it smaller,
according to the following formula:
p0L = Lo 1[Lo(pL)
jNormal(0; )j] :
We make the smallest probability in the probability
distribution Pr, pS larger by precisely the amount by
which we decreased pL, i.e.,
p0S = pS + pL
p0L :
improved upon. In the experiment, we studied how
this baseline performance degrades under the
condition of noise, as described in Section 3.
For illustration purpose, Figure 3 shows the
transformation applied in our previous study [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. For &gt; 1
the amount of noise becomes so large that any value
of probability can be transformed in any other value.
This suggests strongly that &gt; 1 is not really a region
that is of interest in practice. The main reason why we
look at such high values is that this was the range
used in Pradhan et al. paper.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>EXPERIMENTAL RESULTS</title>
      <p>We have performed an experiment investigating the
in uence of biased noise in Hepar II's probabilities
on its diagnostic performance. For the purpose of our
experiment, we assumed that the model parameters
were perfectly accurate and, e ectively, the
diagnostic performance achieved was the best possible. Of
course, in reality the parameters of the model may not
be accurate and the performance of the model can be
We tested 30 versions of the network (each for a
different standard deviation of the noise 2&lt; 0:0; 3:0 &gt;
with 0.1 increments) on all records of the Hepar data
set and computed Hepar II's diagnostic accuracy. We
plotted this accuracy in Figures 4 and 5 as a function
of for di erent values of window size w.</p>
      <p>
        It is clear that Hepar II's diagnostic performance
deteriorates with noise. In order to facilitate
comparison between biased and unbiased noise and, by this,
judgment of the in uence of overcon dence bias on
the results, we reproduce the experimental result of
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] in Figure 6. The results are qualitatively similar,
although it can be seen that performance under
overcon dence bias degrades more slowly with the amount
of noise than performance under random noise.
Performance under undercon dence bias degrades the fastest
of the three. Figure 7 shows the accuracy of Hepar II
(w = 1) for biased and unbiased noise on the same
plot, where this e ect is easier to see.
      </p>
      <p>It is interesting to note that for small values of , such
as &lt; 0:2, there is only a minimal e ect of noise on
performance. This observation may o er some
justication to the belief that Bayesian networks are not
too sensitive to imprecision of their probability
parameters.
5</p>
    </sec>
    <sec id="sec-6">
      <title>SUMMARY</title>
      <p>This paper has studied the in uence of bias in
parameters on model performance in the context of a
practical medical diagnostic model, Hepar II. We believe
that the study was realistic in the sense of focusing on
a real, context-dependent performance measure. Our
study has shown that the performance of Hepar II
is sensitive to noise in numerical parameters, i.e., the
diagnostic accuracy of the model decreases after
introducing noise into numerical parameters of the model.
While our result is merely a single data point that
sheds light on the hypothesis in question, it looks like
overcon dence bias has a smaller negative e ect on
model performance than random noise. Undercon
dence bias leads to most serious deterioration of
performance. While it is only a wild speculation that
begs for further investigation, one might see our
results as an explanation of the fact that humans tend
to be overcon dent rather than undercon dent in their
probability estimates.</p>
      <sec id="sec-6-1">
        <title>Acknowledgments</title>
        <p>This work was supported by the Air Force O ce of
Scienti c Research grant FA9550-06-1-0243, by Intel
Research, and by the MNiI (Ministerstwo Nauki i
Informatyzacji) grant 3T10C03529. We thank Linda van
der Gaag for suggesting extending our earlier work on
sensitivity of Bayesian networks to precision of their
numerical parameters by introducing bias in the noise.
Reviewers for The Sixth Bayesian Modelling
Applications Workshop provided several useful suggestions
that have improved the readability and extended the
scope of the paper.</p>
        <p>The Hepar II model was created and tested using
SMILE, an inference engine, and GeNIe, a
development environment for reasoning in graphical
probabilistic models, both developed at the Decision
Systems Laboratory, University of Pittsburgh, and
available at http://genie.sis.pitt.edu/. We used
SMILE in our experiments and the data pre-processing
module of GeNIe for plotting scatter plot graphs in
Figure 1.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Russell</surname>
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Almond</surname>
          </string-name>
          ,
          <string-name>
            <surname>Louis</surname>
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Dibello</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Jenkins</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          <string-name>
            <surname>Mislevy</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Senturk</surname>
            ,
            <given-names>L.S.</given-names>
          </string-name>
          <string-name>
            <surname>Steinberg</surname>
            , and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Yan</surname>
          </string-name>
          .
          <article-title>Models for conditional probability tables in educational assessment</article-title>
          . In T. Jaakkola and
          <string-name>
            <surname>T</surname>
          </string-name>
          . Richardson, editors,
          <source>Arti cial Intelligence and Statistics</source>
          <year>2001</year>
          , pages
          <fpage>137</fpage>
          {
          <fpage>143</fpage>
          . Morgan Kaufmann,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Russell</surname>
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Almond</surname>
          </string-name>
          , Louis V. DiBello, Brad Moulder, and
          <string-name>
            <surname>Juan-Diego</surname>
          </string-name>
          Zapata-Rivera.
          <article-title>Modeling diagnostic assessment with Bayesian networks</article-title>
          .
          <source>Journal of Educational Measurement</source>
          ,
          <volume>44</volume>
          (
          <issue>4</issue>
          ):
          <volume>341</volume>
          {
          <fpage>359</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Veerle</surname>
            <given-names>H. M.</given-names>
          </string-name>
          <string-name>
            <surname>Coupe</surname>
          </string-name>
          and Linda C. van der Gaag.
          <article-title>Properties of sensitivity analysis of Bayesian belief networks</article-title>
          .
          <source>Annals of Mathematics and Arti - cial Intelligence</source>
          ,
          <volume>36</volume>
          :
          <fpage>323</fpage>
          {
          <fpage>356</fpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <surname>Marek</surname>
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Druzdzel</surname>
            and
            <given-names>Agnieszka</given-names>
          </string-name>
          <string-name>
            <surname>Onisko</surname>
          </string-name>
          .
          <article-title>Are Bayesian networks sensitive to precision of their parameters</article-title>
          ? In S.T.
          <string-name>
            <surname>Wierzchon M. Klopotek</surname>
          </string-name>
          , M. Michalewicz, editor,
          <source>Intelligent Information Systems XVI, Proceedings of the International IIS'08 Conference</source>
          , pages
          <volume>35</volume>
          {
          <fpage>44</fpage>
          , Warsaw, Poland,
          <year>2008</year>
          . Academic Publishing House EXIT.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>Max</given-names>
            <surname>Henrion</surname>
          </string-name>
          , John S. Breese, and
          <string-name>
            <given-names>Eric J.</given-names>
            <surname>Horvitz</surname>
          </string-name>
          .
          <article-title>Decision Analysis and Expert Systems</article-title>
          .
          <source>AI Magazine</source>
          ,
          <volume>12</volume>
          (
          <issue>4</issue>
          ):
          <volume>64</volume>
          {
          <fpage>91</fpage>
          ,
          <string-name>
            <surname>Winter</surname>
          </string-name>
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>O.</given-names>
            <surname>Kipersztok</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          .
          <article-title>Another look at sensitivity analisis of Bayesian networks to imprecise probabilities</article-title>
          .
          <source>In Proceedings of the Eight International Workshop on Arti cial Intelligence and Statistics (AISTAT-2001)</source>
          , pages
          <fpage>226</fpage>
          {
          <fpage>232</fpage>
          , San Francisco, CA,
          <year>2001</year>
          . Morgan Kaufmann Publishers.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>B.</given-names>
            <surname>Middleton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.A.</given-names>
            <surname>Shwe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            <surname>Heckerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Henrion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.J.</given-names>
            <surname>Horvitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.P.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.F.</given-names>
            <surname>Cooper</surname>
          </string-name>
          .
          <article-title>Probabilistic diagnosis using a reformulation of the INTERNIST{1/QMR knowledge base: II. Evaluation of diagnostic performance</article-title>
          .
          <source>Methods of Information in Medicine</source>
          ,
          <volume>30</volume>
          (
          <issue>4</issue>
          ):
          <volume>256</volume>
          {
          <fpage>267</fpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Granger</surname>
          </string-name>
          Morgan and
          <string-name>
            <given-names>Max</given-names>
            <surname>Henrion</surname>
          </string-name>
          .
          <article-title>Uncertainty: A Guide to Dealing with Uncertainty in Quantitative Risk and Policy Analysis</article-title>
          . Cambridge University Press, Cambridge,
          <year>1990</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>Agnieszka</given-names>
            <surname>Onisko</surname>
          </string-name>
          and
          <string-name>
            <given-names>Marek J.</given-names>
            <surname>Druzdzel</surname>
          </string-name>
          .
          <article-title>Effect of imprecision in probabilities on Bayesian network models: An empirical study</article-title>
          .
          <source>In Working notes of the European Conference on Arti cial Intelligence in Medicine (AIME-03)</source>
          :
          <article-title>Qualitative and Model-based Reasoning in Biomedicine</article-title>
          , Protaras, Cyprus,
          <source>October</source>
          <volume>18</volume>
          {
          <fpage>22</fpage>
          2003.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <surname>Agnieszka</surname>
            <given-names>Onisko</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Marek J.</given-names>
            <surname>Druzdzel</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Hanna</given-names>
            <surname>Wasyluk</surname>
          </string-name>
          .
          <article-title>Extension of the Hepar II model to</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <surname>Agnieszka</surname>
            <given-names>Onisko</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Marek J.</given-names>
            <surname>Druzdzel</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Hanna</given-names>
            <surname>Wasyluk</surname>
          </string-name>
          .
          <article-title>Learning Bayesian network parameters from small data sets: Application of Noisy-OR gates</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          ,
          <volume>27</volume>
          (
          <issue>2</issue>
          ):
          <volume>165</volume>
          {
          <fpage>182</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <surname>Agnieszka</surname>
            <given-names>Onisko</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Marek J.</given-names>
            <surname>Druzdzel</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Hanna</given-names>
            <surname>Wasyluk</surname>
          </string-name>
          .
          <article-title>An experimental comparison of methods for handling incomplete data in learning parameters of Bayesian networks</article-title>
          . In S.T.
          <string-name>
            <surname>Wierzchon M. Klopotek</surname>
          </string-name>
          , M. Michalewicz, editor,
          <source>Intelligent Information Systems, Advances in Soft Computing Series</source>
          , Heidelberg,
          <year>2002</year>
          . Physica-Verlag (A Springer-Verlag Company).
          <volume>351</volume>
          {
          <fpage>360</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Judea</given-names>
            <surname>Pearl</surname>
          </string-name>
          .
          <article-title>Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference</article-title>
          . Morgan Kaufmann Publishers, Inc., San Mateo, CA,
          <year>1988</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <surname>Malcolm</surname>
            <given-names>Pradhan</given-names>
          </string-name>
          , Max Henrion, Gregory Provan,
          <source>Brendan del Favero, and Kurt Huang</source>
          .
          <article-title>The sensitivity of belief networks to imprecise probabilities: An experimental investigation</article-title>
          .
          <source>Arti cial Intelligence</source>
          ,
          <volume>85</volume>
          (
          <issue>1</issue>
          {2):
          <volume>363</volume>
          {
          <fpage>397</fpage>
          ,
          <year>August 1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Frank</given-names>
            <surname>Rijmen</surname>
          </string-name>
          .
          <article-title>Bayesian networks with a logistic regression model for the conditional probabilities</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          , in press.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>M.A.</given-names>
            <surname>Shwe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Middleton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.E.</given-names>
            <surname>Heckerman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Henrion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.J.</given-names>
            <surname>Horvitz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.P.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.F.</given-names>
            <surname>Cooper</surname>
          </string-name>
          .
          <article-title>Probabilistic diagnosis using a reformulation of the INTERNIST{1/QMR knowledge base: I. The probabilistic model and inference algorithms</article-title>
          .
          <source>Methods of Information in Medicine</source>
          ,
          <volume>30</volume>
          (
          <issue>4</issue>
          ):
          <volume>241</volume>
          {
          <fpage>255</fpage>
          ,
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>Linda</surname>
            <given-names>C. van der Gaag and Silja</given-names>
          </string-name>
          <string-name>
            <surname>Renooij</surname>
          </string-name>
          .
          <article-title>Analysing sensitivity data from probabilistic networks</article-title>
          .
          <source>In Uncertainty in Arti cial Intelligence: Proceedings of the Sixteenth Conference (UAI2001)</source>
          , pages
          <fpage>530</fpage>
          {
          <fpage>537</fpage>
          , San Francisco, CA,
          <year>2001</year>
          . Morgan Kaufmann Publishers.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>