<!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>A Web-based Tool for Expert Elicitation in Distributed Teams</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Carlo Spaccasassi</string-name>
          <email>spaccasa@ie.ibm.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lea Deleris</string-name>
          <email>lea.deleris@ie.ibm.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>IBM Dublin Research Lab, Damastown</institution>
          ,
          <addr-line>Dublin, D15</addr-line>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>We present in this paper a web-based tool developed to enable expert elicitation of the probabilities associated with a Bayesian Network. The motivation behind this tool is to enable assessment of probabilities from a distributed team of experts when face-to-face elicitation is not an option, for instance because of time and budget constraints. In addition to the ability to customize surveys, the tool provides support for both quantitative and qualitative elicitation, and o ers administrative features such as elicitation surveys management and probability aggregation.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        There is a thriving research community that studies
techniques for learning the structure and parameters
of a belief network from data [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. However, when there
is no relevant data available, or any literature to guide
the construction of the model, the network must be
elicited from the individuals whose beliefs are being
captured - such a person is often referred to as the
domain expert, or simply expert. Both the structure and
the parameters of a belief network need to be elicited.
Often it is easier to construct the structure of a belief
network, as compared to eliciting the parameters, i.e.
the conditional probabilities [
        <xref ref-type="bibr" rid="ref2 ref3 ref4 ref5">2, 3, 4, 5</xref>
        ]. We focus in
this paper on the subject of parameter elicitation,
assuming that the structure of the network has already
been ascertained.
      </p>
      <p>
        Best practice in terms of parameter elicitation is based
on face-to-face interviews of the expert by a trained
analyst (or knowledge engineer) [
        <xref ref-type="bibr" rid="ref6 ref7 ref8">6, 7, 8</xref>
        ]. However,
situations arise where such an approach is not feasible,
mostly because of time and budget constraints. This is
especially salient in projects with a distributed team of
experts, which as Bayesian modeling gains popularity
are more likely to arise than in the past [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
Consider the following real-world example. We
undertook a project focused on understanding variability in
the performance of a speci c human resource process
and elected to use a Bayesian network as our modeling
framework. The domain experts were regular
employees acting as experts, they were scattered across the
world and spanned di erent domains of expertise. We
did not have the possibility of undertaking face-to-face
sessions and opted for replacing them with phone
interviews. The structural de nition of the model,
identifying the variables and inter-dependence, did not yield
many di culties nor complains from the experts. By
contrast, the quantitative phase proved time
consuming and generated signi cant frustration on both sides
(analysts and experts). In particular, our e orts were
hampered by (i) the time di erence leading to early or
late at night sessions for either the expert or the
analyst and (ii) the time pressure on the experts because
of the analyst waiting on the phone for them to
provide an answer. The main challenge however was to
have experts understand the format of the conditional
probability table (CPTs). Overall, we concluded that
phone elicitation was not an adequate support for
remote parameter elicitation and that eliciting
probabilities directly in the CPT created unnecessary cognitive
burden.
      </p>
      <p>The risk elicitation tool that we present here aims at
addressing those concerns. We opted for a web-based
tool, whose asynchronous feature enables more
comfortable time management of the elicitation process
from experts side (albeit less control for the analyst).
An advantage of the web-based set up is the ability
for the analyst to centrally manage the elicitation
surveys. While we recognize that web-based approaches
are second-best to face-to-face elicitation, we feel that
such a tool would enable wider adoption of Bayesian
models in settings where face-to-face elicitation is
unlikely.</p>
      <p>The remainder of the paper is organized as follows. In
Section 2, we review the literature related to
probability elicitation in Bayesian networks. Section 3 provides
an in-depth description of the Risk Elicitation tool.
Finally Section 4 discusses related research endeavors.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Expert Elicitation in Belief</title>
    </sec>
    <sec id="sec-3">
      <title>Networks</title>
      <p>
        The process of eliciting probabilities from experts
is known to be a ected by numerous cognitive
biases, such as overcon dence and anchoring e ects [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
When eliciting probabilities in the context of a belief
network, additional practical challenges must be
considered [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ].
      </p>
      <p>
        One particular problem lies with the number of
parameters that have to be elicited from the experts, which
leads to long and tiring elicitation sessions and
sometimes inconsistent and approximate answers. To
alleviate such problems, the analyst often resorts to
making assumptions about the conditional relationships
that reduce the number of parameters to be elicited by
parameterizing the network structures using
NOISYOR and NOISY-MAX models (see for instance [
        <xref ref-type="bibr" rid="ref12 ref2">2, 12</xref>
        ]).
This is in fact an option that we will provide in the
next version of our tool.
      </p>
      <p>
        As we mentioned in the introduction, another
challenge associated with elicitation in Bayesian networks
is the problem for the expert to understand the
structure of a conditional probability table. While
considering scenarios is fairly intuitive, understanding which
entry corresponds to which scenario can be
unnecessarily confusing. E orts have thus been made to improve
the probability entry interface in probability
elicitation tools [
        <xref ref-type="bibr" rid="ref13 ref14">13, 14</xref>
        ]. Our tool integrates ndings from
this stream of research, by asking simple text questions
corresponding to each cell of the CPT and by
grouping all assessments corresponding to the same scenario
together (although our support does not enable us to
show them all at once but simply sequentially).
Indeed, previous research has shown that presenting all
conditioning cases for a node together during
elicitation reduces the e ect of biases [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
      </p>
      <p>
        Finally, the need to provide precise numerical answers
is considered an additional cognitive obstacle for
experts. One solution to address this problem is to
present the elicitation scale with verbal and
numerical anchors [
        <xref ref-type="bibr" rid="ref16 ref17 ref5">15, 5, 16</xref>
        ]. We included such ndings into
the design of our tool, enabling analyst to ask
questions in a qualitative manner. Another solution is to
elicit qualitative knowledge from experts, for instance
by asking them to provide a partial order of the
probabilities and leveraging limited data whenever available
[
        <xref ref-type="bibr" rid="ref18">17</xref>
        ].
      </p>
    </sec>
    <sec id="sec-4">
      <title>Description of the Tool</title>
      <p>
        The Risk Elicitation tool is a web-based
application that o ers both (i) an interactive web interface
through which parameter elicitation surveys
themselves can be answered and automatically collected,
and (ii) support for survey management. The tool can
be freely accessed from the Internet; any web browser
with Adobe's Flash Player 10 [
        <xref ref-type="bibr" rid="ref19">18</xref>
        ] installed will be able
to run it. Given its web availability, the Risk
Elicitation tool is virtually always available. Moreover,
interviewees can complete a survey with little external help,
pause and resume the survey at a later time, thus
further relaxing the need to coordinate interviewers and
interviewees.
      </p>
      <p>We distinguish two classes of users of the Risk
Elicitation tool: analysts and domain experts. In the
following sections we describe the main use cases of the
tool setting up elicitation surveys (Analyst),
answering a survey (Expert) and collecting and aggregating
results (Analyst). We also provide at the end of this
section a description of the architectural set up along
with a short discussion of the technical challenges that
we met.
3.2</p>
      <sec id="sec-4-1">
        <title>Setting up Elicitation Surveys</title>
        <p>As mentioned earlier, we assume that the starting
point of the process is a Bayesian network whose
structure is fully de ned, including clear description of
nodes and associated states. The rst step for the
analyst is therefore to load his Bayesian Network le on
the Risk Elicitation tool. The tool will automatically
generate a sample survey, which the analyst can
further customize. The second step for the analyst is to
create a user account for each expert. Experts, having
various domains of expertise, may not be quali ed to
provide information for all the nodes in the Bayesian
network. To address that situation, the analyst can
dene roles and associate a subset of the nodes to each
role. Each expert can then be associated to one or
several roles and will only be asked questions on the
Bayesian nodes pertaining his/her role(s)1.</p>
        <p>The main features of the tool that enable survey setup
are:
BBN Import The Risk Elicitation tool enables
analysts to create a personalized survey of the BBN
1In the remainder of this paper we will refer to expert
and analyst as he.
they want to elicit. The BBN can be
submitted from the Risk Elicitation tool to a server that
automatically generates a survey template. The
template can then be customized by the analyst,
who can perform the following modi cations:
Provide descriptive details on the Bayesian
networks, its nodes and its states; add
analyst notes to speci c questions,
Choose how to elicit node, whether
quantitatively or qualitatively,
De ne, for the qualitative questions, the
possible answers and relative numerical ranges
(which we call calibrations),
Customize the question texts,
Choose whether to ask experts about their
con dence level,
Assign an order to the elicitation process (to
control in which order nodes are elicited).</p>
        <p>At the moment we only support the GeNIe le
format, but our tool can be easily extended to other
formats. We have developed our own format for
Bayesian networks, to which the GeNIe le format
is translated during the template generation.
User Management In the Administration section,
analysts can register experts to the Risk
Elicitation tool and assign them roles. The analyst
is presented with a classic user management
console, where he can add, delete and update both
user accounts and the roles they play in an
elicitation survey. Whenever a user account is created,
the tool generates an automatic email, that the
analyst can further customize and send to the
expert, presenting him his credentials to access the
tool and the survey he has been assigned.
3.3</p>
      </sec>
      <sec id="sec-4-2">
        <title>Expert Elicitation</title>
        <p>After an expert has been noti ed of his account
credentials, he can access the Risk Elicitation tool. Upon
logging in, he can select one of the surveys and roles he
has been assigned to. At that point, he is o ered the
option of reviewing a short tutorial of the tool. Moving
to the survey answering, he is presented with questions
for each relevant node of the Bayesian network. They
can ask for either quantitative or qualitative answers.
When the survey is complete, the expert can submit
the survey on the Risk Elicitation tool and exit.
Expert elicitation is supported by the following
features:</p>
      </sec>
      <sec id="sec-4-3">
        <title>Quantitative and Qualitative Elicitation</title>
        <p>Probabilities can be elicited through either
quantitative or qualitative questions. Quantitative
questions ask experts to state exact probabilities,
using a pie chart for discrete nodes. As shown
in Figure 1, each slice of the pie represents a
state of the Bayesian node with its associated
probability. Users can drag the pie chart edges
to provide their estimates of the node being
currently evaluated, given that the scenarios
de ned in the context pane (parent nodes and
states), at the top left corner of the question
page. We also provide direct feedback about the
implied odd ratios on the right side of the pie
chart, as some situations may be more suited to
thinking about relative chances. The map in the
top right corner shows the local network topology
for the node being elicited. The full Bayesian
Network is also available in the Road Map tab
on the left-hand side.</p>
        <p>Qualitative questions do not elicit exact
probabilities but ranges of probabilities. As shown in
Figure 2, experts are o ered a set of labeled ranges,
called calibrations, and can select the calibration
that best describes the probability of a node being
in a state, given the conditions expressed in the
Context pane. Calibrations are initially de ned
by analysts at BBN Import time, both in terms
of labels and numerical range. However, experts
have the ability to modify the numerical values of
ranges from the tool itself if they feel they are not
appropriate for the speci c question.</p>
        <p>Summary Tables There are as many questions for
each node as parent state con gurations. After
all questions for a node have been answered, the
expert is shown a summary table that provides
a report of all the answers they have given (see
Figure 3). This is in fact the conditional
probability built from the answers provided. However,
at this point the expert has been actively involved
in building it from the ground up and should not
be as confused by the structure as if we had
presented it upfront. The summary table enables to
compare answers across scenarios. If the expert
wants to change any of the input, he can navigate
back to the associated question by clicking on the
related cell in the summary table, as shown in
Figure 3. When the expert is satis ed with his
answers, he can save and proceed to either
answer questions about another node, or submit the
survey if all nodes have been answered.</p>
        <p>Con dence For each question/node, the expert can
provide an indication of his con dence in his
answer (provided the analyst has enabled this
feature). At this point, con dence indication is
qualitative (Low/Medium/High) but could be further
de ned in terms of notional sample space for
instance. Con dence information can be used
during aggregation, to modify the weight an answer
has, or to provide a threshold to lter out answers
(e.g. consider only high con dence answers).
Comment For each question, the expert has the
opportunity to provide a comment through an
apposite collapsible text area, placed below the
question itself. One use of the comment section is
to provide details about understanding of a node
description or state or to specify an implicit
assumption that the expert has made when
providing answers.
3.4</p>
      </sec>
      <sec id="sec-4-4">
        <title>Gathering information</title>
        <p>After setting up surveys and notifying experts, the
analyst can use the Status section of the tool to check
on the progress of the elicitation process. He is
provided with a summary of how many surveys have been
completed. From the same section, experts can be
reminded to complete their survey by an automatically
generated email. Once enough surveys have been
completed, the analyst has the option to aggregate expert
answers and export a le of the Bayesian network
populated with the aggregated values.</p>
        <p>The main mechanisms to enable gathering and
aggregation of answers are:
Surveys Monitoring Analysts can monitor the
advancement of survey completion from a dedicated
section, called Status Tab. The Status Tab
reports which experts have completed their surveys
and when, which surveys have not been submitted
yet and which experts have been reminded to
nish the survey. To remind an expert to complete
his survey, an automatic mailing system is
provided to automatically generate and send email
reminders to the interested parties. Generated
email kindly remind experts of which surveys they
have been assigned, the role they play into it, their
account details in case they forgot and a link to
the tool. Analysts can also customize the
generated email before sending it from the tool itself,
as shown in Figure 4.</p>
      </sec>
      <sec id="sec-4-5">
        <title>Probability Aggregation After all surveys have</title>
        <p>
          been completed, an analyst may need to
aggregate the answers provided by the experts. We
currently support two methods of aggregation:
linear opinion pool and logarithmic opinion pool [
          <xref ref-type="bibr" rid="ref20">19</xref>
          ].
The analyst can control the aggregation method
by assigning a weight to each expert, to credit
some experts more importance. The tool goes
through all completed surveys, collects the
probabilities elicited by experts and aggregates them
using the method and weights speci ed by the
analyst. Given that qualitative questions do not
provide an exact number but a range, we take the
midpoint of each range as the representative of the
range (while acknowledging that this is a rather
simple approach which we will re ne in later
versions of the tool).
        </p>
        <p>Aggregated values are used to populate the
original Bayesian Network le imported in the tool.
The analyst can then export the aggregated BBN
on his computer.</p>
      </sec>
      <sec id="sec-4-6">
        <title>3.5 Implementation Details</title>
        <p>
          The tool employs a classic two-tiers architecture, with
a web application developed on top of IBM's
Websphere Application Server 6.1 [
          <xref ref-type="bibr" rid="ref21">20</xref>
          ] and a Flash client
built with Adobe's Flex Builder 3 [
          <xref ref-type="bibr" rid="ref19">18</xref>
          ]. We have
employed a Model-Driven Architecture approach [
          <xref ref-type="bibr" rid="ref22">21</xref>
          ] to
develop the tool, following the standard
Model-ViewControl pattern, where the view is the Flash client,
most of the controls are in the web server and the
model is the survey itself, exchanged and modify by
both server and clients. Communication is handled by
web services using JAX-RPC [
          <xref ref-type="bibr" rid="ref23">22</xref>
          ].
        </p>
        <p>
          Surveys data has been modeled using the Eclipse
Modeling Framework (EMF) [
          <xref ref-type="bibr" rid="ref24">23</xref>
          ]. We rst designed an
abstract, graphical representation of the data that the
survey needed to capture in EMF. The resulting
representation, or model, is similar to a UML Class
diagram. Code to manipulate and also persist the model
is automatically generated from the model and taken
care of by EMF.
        </p>
        <p>EMF does not support natively Actionscript, Adobe's
programming language: EMF's standard tools cannot
generate model manipulation code automatically for
it. To address this problem, we bridged EMF to a
Web Service de nition le (WSDL). We rst exported
EMF's models to an XML Schema, which we imported
into the WSDL le. Adobe's Flex can then generate
code from the WSDL le both to communicate with
the server and to access the model.</p>
        <p>
          Communication points between server and client are
also generated from the WSDL le. Extensions and
modi cations to either the model or the
communication points, on the server and client side, were handled
automatically by either EMF or Flex, handling manual
error-prone tasks and saving development time.
Finally, we import and export BBN les written in the
SMILE/GeNIe format [
          <xref ref-type="bibr" rid="ref25">24</xref>
          ]. EMF automatically
manages GeNIe le loading and saving, using the XML
Schema de nition which is publicly available. The
GeNIe les are then converted to an internal EMF model
designed to ease BBN manipulation.
4
        </p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Related Research</title>
      <p>In this section, we brie y discuss some of the research
questions that have arisen from the development of
the risk elicitation tool. In particular, we have focused
on the e ect on the elicitation process of the order in
which the nodes are presented. Because of the
webbased feature of our tool, we have more freedom in
determining the order than traditional face-to-face
approaches.
We considered the following question: Does the
parameter elicitation ordering in belief networks even
matter to a domain expert? To answer this question, we
explored the relationship between node ordering and
user-friendliness of the elicitation process in an
experimental setting. Speci cally, three di erent node
orderings for the same belief network were considered:
two `top-down' and one `bottom-up' ordering, with
parameter elicitation performed using the risk elicitation
tool described in this paper. Around seventy Stanford
University graduate students were asked to elicit a
belief network with six nodes on the subject of getting
a job immediately after their studies; they were split
into approximately three equal groups, one group for
each order. The top-down orders presented questions
to elicit parameters of parent nodes before children
nodes, while the bottom-up order visited children
before parents.</p>
      <p>In this particular experiment, there was no drop-out
- all subjects completed the elicitation process,
perhaps due to the small size of the network and the
incentive of extra class credit (which was only granted
for complete assessments). Along with the Web-based
elicitation survey, the students also responded to a
short survey requesting feedback about the elicitation
process and the corresponding tool. The results did
indicate that the order in which the nodes are
presented a ects not only how comfortable experts claim
to be with the process, but also the time required to
elicit the parameters. In particular, there was a
signi cant di erence between the orders with regard to
user-friendliness based on the survey responses. For
the two top-down orders, hardly any of the subjects
felt that the order was confusing, compared to 23% for
the bottom-up order. Moreover, the average time to
complete the elicitation was lower for the two top-down
orders as compared to the bottom-up order. The two
top-down orders di ered in survey completion time:
an average of 400 seconds with a standard deviation
of 170 seconds for the rst one, against an average of
500 seconds with a standard deviation of 400 seconds
for the second one.
4.2</p>
      <sec id="sec-5-1">
        <title>Ordering Mathematically</title>
        <p>In a separate study, we explored the problem of
determining, for a particular belief network whose structure
is known, the optimal order in which the parameters
of the network should be elicited. Our objective in
determining the order is to maximize information
acquisition. While the order of the elicitation process
is irrelevant if all nodes are elicited and if experts are
able to provide their true beliefs, we believe that new
trends in belief network modeling make these
assumptions questionable. When only a subset of the nodes
may be elicited or when answers can be noisy, it is
necessary to devise an ordering strategy that seeks to
salvage as much information as possible.</p>
        <p>We therefore developed an analytical method for
determining the optimal order for eliciting these
probabilities, where optimality is de ned as shortest distance to
the true distribution (on which we have a prior). We
considered the case where experts may drop out of the
elicitation process and modeled the problem through
a myopic approach.</p>
        <p>For the case of uniform Dirichlet priors, we show that
the `bottom up' elicitation heuristic can be optimal.
For other priors, we showed that the optimal order
often depends on which variables are of primary interest
to the analyst (whether all the nodes in the network
or a subset, as is often the case in risk analytic
applications).</p>
        <p>
          The orderings resulting from the methods proposed in
that model are driven solely by analytical concerns,
and do not consider the user-friendliness of the
elicitation process. In practice, as we discussed in the
previous section, di erent orderings can impact the
perceived di culty of the process, thereby making the
elicitation of complete and accurate beliefs more di
cult. These results further motivate the need to
investigate the consequence of forcing a possibly unnatural
ordering upon experts and to assess whether the
`information gain' from an analytical perspective is worth
the `cost' in practice, i.e. in terms of the amount of
confusion, fatigue and increased imprecision. More
generally, empirical research to investigate how experts
actually react to di erent orders is an important topic,
similar to the empirical work on understanding how
experts actually feel about di erent probability
elicitation tools [
          <xref ref-type="bibr" rid="ref14 ref16">15, 14</xref>
          ]. The tool presented in this paper
could be a useful support for such endeavors.
4.3
        </p>
      </sec>
      <sec id="sec-5-2">
        <title>Comparison with existing web-based tools</title>
        <p>
          Finally, we compare our tool to two existing
webbased tools for risk elicitation pointed out by
reviewers: BayesiaLab [
          <xref ref-type="bibr" rid="ref15">25</xref>
          ] and the Elicitation Tool from
ACERA, the Australian Center of Excellence of Risk
Analysis, described in [
          <xref ref-type="bibr" rid="ref26">26</xref>
          ].
ing with Bayesian networks. It supports many
features, such as BBN modeling, BBN learning from data,
and elicitation. With respect to elicitation, analysts
can create a pro le for each expert, select the portions
of a variables' CPT to be elicited, and send this
information to a web server over the Internet. The web
server generates surveys to elicit probabilities
quantitatively, using a slider bar to capture expert input.
Experts can also provide a level of con dence in an
answer, expressed as a percentage, along with additional
comments. In comparison with our tool, many features
are similar: both tools provide expert pro le
management, on-line surveys, and survey import and export.
Our tool, however, allows for both quantitative and
qualitative elicitation of probabilities. The elicitation
formats are di erent as well: our tool uses pie charts
to capture quantitative probabilistic information for
discrete random variables and a slider bar (expressed
as a percentage di erence from baseline) to capture
impact of a factor on a (continuous-valued) metric
under a speci ed scenario. Additionally, our tool allows
analysts to fully customize surveys and aggregate by
one of several algorithms. We also provide experts
with additional contextual information, including a
local and global map of the Bayesian network, a tutorial,
the description of each node and state in the Bayesian
network, along with analysts' comments.
        </p>
        <p>The Elicitation Tool from ACERA is quite di erent
from both our tool and BayesiaLab, in that it is an
online questionnaire to directly elicit estimates of risks.
Questions are open-ended. An example is: "Will
DAGGRE win?". When answering a question, users
need to provide four numerical estimates in an HTML
form: the lowest estimate, the highest estimate, the
best estimate and a con dence level. A graphical
representation of the estimates is displayed and the user
can submit the answers. After submission, the tool
displays a selection of answers from users who have
already completed the survey. The user is given the
chance to review his own answers in light of this new
input and submit again. In contrast, our tool allows
review of only the expert's own answers, as shown in
Summary Pages, and are tailored for Bayesian
networks where the goal is to elicit (conditional)
probabilistic information. To help experts frame the
context of the question, we provide additional
information, such as the Bayesian network's local map and
network description. ACERA's tool does not seem to
be tied to Bayesian networks, so less contextual
information is required in this case.
5</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>BayesiaLab, a commercial product developed by
Bayesia, provides an integrated environment for
workIn this paper, we describe a web-based expert
elicitation tool for Bayesian network models that is especially
relevant for the management of distributed teams of
experts. We focus especially on facilitating the
understanding of a conditional probability table by asking
each entry separately and in a textual format. The tool
enables the management of the survey administration
cycle, from the customization of the survey and the
creation of roles (associated with a subset of the
network) to the monitoring of progress from experts and
aggregation of results.</p>
      <p>
        While we have implemented several best-practices
from the elicitation literature, we also have identi ed
various directions for further development. One
simple extension will consist in allowing for NOISY-OR
and NOISY-MAX parameterization. Going further,
we would like to more strongly encourage for
qualitative elicitation, asking for orders of magnitudes for
instance, or if limited date was available following the
relative order procedure suggested by [
        <xref ref-type="bibr" rid="ref18">17</xref>
        ]. In fact, for
cases where partial data is available, one could also
consider providing feedback to the expert directly
during the elicitation session [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ]. Finally, we have started
providing support for utility/value nodes but so far in
a coarse manner. Initially, experts are asked to
identify a parent states con guration for which they are
comfortable with providing an exact estimate of
utility. We call this con guration base case. For non-base
case con gurations, experts only need to specify how
much in percentage the utility of the node di ers from
the base case.
      </p>
      <sec id="sec-6-1">
        <title>Acknowledgements</title>
        <p>This work is partially supported by fundings from IDA
Ireland (Industrial Development Agency).</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>D.</given-names>
            <surname>Heckerman</surname>
          </string-name>
          .
          <article-title>A tutorial on learning with bayesian networks</article-title>
          . In M. Jordan, editor,
          <source>Learning in Graphical Models</source>
          . Kluwer, Netherlands,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M.</given-names>
            <surname>Henrion</surname>
          </string-name>
          .
          <article-title>Some practical issues in constructing belief networks</article-title>
          . In L.
          <string-name>
            <surname>Kanal M. Henrion</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Shachter</surname>
          </string-name>
          and J. Lemmer, editors,
          <source>Proceedings of the Fifth Conference on Uncertainty in Arti - cial Intelligence</source>
          , pages
          <fpage>161</fpage>
          {
          <fpage>173</fpage>
          .
          <string-name>
            <surname>Elsevier</surname>
            <given-names>Science</given-names>
          </string-name>
          , New York, NY,
          <year>1989</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Druzdzel</surname>
          </string-name>
          and
          <string-name>
            <surname>L. van der Gaag.</surname>
          </string-name>
          <article-title>Elicitation of probabilities for belief networks: Combining qualitative and quantitative information</article-title>
          . In P. Besnard and S. Hanks, editors,
          <source>Proceedings of the Eleventh Conference on Uncertainty in Articial Intelligence</source>
          , pages
          <fpage>141</fpage>
          {
          <fpage>148</fpage>
          . Morgan Kau - man, San Francisco, CA,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Druzdzel</surname>
          </string-name>
          and
          <string-name>
            <surname>L. van der Gaag.</surname>
          </string-name>
          <article-title>Building probabilistic networks: Where do the numbers come from</article-title>
          ?
          <source>IEEE Transactions on Knowledge and Data Engineering</source>
          ,
          <volume>12</volume>
          (
          <issue>4</issue>
          ):
          <volume>481</volume>
          {
          <fpage>486</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>L. van der</given-names>
            <surname>Gaag</surname>
          </string-name>
          , S. Renooij,
          <string-name>
            <given-names>C.</given-names>
            <surname>Witteman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Aleman</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Taal</surname>
          </string-name>
          .
          <article-title>How to elicit many probabilities</article-title>
          . In K. Laskey and H. Prade, editors,
          <source>Proceedings of the Fifteenth Conference on Uncertainty in Arti cial Intelligence</source>
          , pages
          <fpage>647</fpage>
          {
          <fpage>665</fpage>
          . Morgan Kau man, San Francisco, CA,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Spetzler</surname>
          </string-name>
          and C. von Holstein.
          <article-title>Probability encoding in decision analysis</article-title>
          .
          <source>Management Science</source>
          ,
          <volume>22</volume>
          (
          <issue>3</issue>
          ):
          <volume>340</volume>
          {
          <fpage>358</fpage>
          ,
          <year>1975</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>M.</given-names>
            <surname>Merkhofer</surname>
          </string-name>
          .
          <article-title>Quantifying judgmental uncertainty: Methodology, experiences and insights</article-title>
          .
          <source>IEEE Transactions on Systems, Man and Cybernetics</source>
          ,
          <volume>17</volume>
          (
          <issue>5</issue>
          ):
          <volume>741</volume>
          {
          <fpage>752</fpage>
          ,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>R.L.</given-names>
            <surname>Keeney</surname>
          </string-name>
          and D. von Winterfeldt.
          <article-title>Eliciting probabilities from experts in complex technical problems</article-title>
          . Engineering Management, IEEE Transactions on,
          <volume>38</volume>
          (
          <issue>3</issue>
          ):
          <volume>191</volume>
          {201, aug
          <year>1991</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <surname>Sandra</surname>
            <given-names>Ho mann</given-names>
          </string-name>
          , Paul Fishbeck, Alan Krupnick, and
          <string-name>
            <given-names>Michael</given-names>
            <surname>McWilliams</surname>
          </string-name>
          .
          <article-title>Elicitation from large, heterogeneous expert panels: Using multiple uncertainty measures to characterize information quality for decision analysis</article-title>
          .
          <source>Decision Analysis</source>
          ,
          <volume>4</volume>
          (
          <issue>2</issue>
          ):
          <volume>91</volume>
          {
          <fpage>109</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>D.</given-names>
            <surname>Kahneman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Slovic</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Tversky</surname>
          </string-name>
          .
          <article-title>Judgment under Uncertainty: Heuristics and Biases</article-title>
          . Cambridge University Press,
          <year>1982</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>Renooij</surname>
          </string-name>
          .
          <article-title>Probability elicitation for belief networks: Issues to consider</article-title>
          .
          <source>The Knowledge Engineering Review</source>
          ,
          <volume>16</volume>
          (
          <issue>3</issue>
          ):
          <volume>255</volume>
          {
          <fpage>269</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Adam</given-names>
            <surname>Zagorecki</surname>
          </string-name>
          and
          <string-name>
            <given-names>Marek</given-names>
            <surname>Druzdzel</surname>
          </string-name>
          .
          <article-title>Knowledge engineering for bayesian networks: How common are noisy-max distributions in practice?</article-title>
          <source>In Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Arti cial Intelligence August 29 { September 1</source>
          ,
          <year>2006</year>
          ,
          <source>Riva del Garda</source>
          , Italy, pages
          <volume>482</volume>
          {
          <fpage>486</fpage>
          , Amsterdam, The Netherlands, The Netherlands,
          <year>2006</year>
          . IOS Press.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>Hope</given-names>
            <surname>Nicholson Korb</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. R.</given-names>
            <surname>Hope</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. E.</given-names>
            <surname>Nicholson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>K. B.</given-names>
            <surname>Korb</surname>
          </string-name>
          .
          <article-title>Knowledge engineering tools for probability elicitation</article-title>
          .
          <source>Technical report</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>H.</given-names>
            <surname>Wang</surname>
          </string-name>
          and
          <string-name>
            <surname>M. Druzdzel.</surname>
          </string-name>
          <article-title>User interface tools for navigation in conditional probability tables and elicitation of probabilities in bayesian networks</article-title>
          . In C. Boutilier and M. Goldszmidt, editors,
          <source>Proceedings of the Sixteenth Conference on Uncertainty in Arti cial Intelligence</source>
          , pages
          <fpage>617</fpage>
          {
          <fpage>625</fpage>
          . Morgan Kaufmann, San Francisco, CA,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [25]
          <string-name>
            <surname>Bayesia</surname>
          </string-name>
          . Bayesialab. http://www.bayesia.com/ en/products/bayesialab.php.
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>S.</given-names>
            <surname>Renooij</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Witteman</surname>
          </string-name>
          .
          <article-title>Talking probabilities: Communicating probabilistic information with words and numbers</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          ,
          <volume>22</volume>
          :
          <fpage>169</fpage>
          {
          <fpage>194</fpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>F.</given-names>
            <surname>Fooladvandi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Brax</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Gustavsson</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Fredin</surname>
          </string-name>
          .
          <article-title>Signature-based activity detection based on bayesian networks acquired from expert knowledge</article-title>
          .
          <source>In Information Fusion</source>
          ,
          <year>2009</year>
          . FUSION '
          <volume>09</volume>
          . 12th International Conference on, pages
          <volume>436</volume>
          {
          <fpage>443</fpage>
          , july
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>E. M.</given-names>
            <surname>Helsper</surname>
          </string-name>
          , L. C.
          <string-name>
            <surname>van der Gaag</surname>
            ,
            <given-names>A. J.</given-names>
          </string-name>
          <string-name>
            <surname>Feelders</surname>
            ,
            <given-names>W. L. A.</given-names>
          </string-name>
          <string-name>
            <surname>Loe</surname>
            <given-names>en</given-names>
          </string-name>
          , P. L.
          <string-name>
            <surname>Geenen</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A. R. W.</given-names>
            <surname>Elbers</surname>
          </string-name>
          .
          <article-title>Bringing order into bayesian-network construction</article-title>
          .
          <source>In Proceedings of the 3rd international conference on Knowledge capture, K-CAP '05</source>
          , pages
          <fpage>121</fpage>
          {
          <fpage>128</fpage>
          , New York, NY, USA,
          <year>2005</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [18]
          <string-name>
            <surname>Je</surname>
            <given-names>Tapper</given-names>
          </string-name>
          , Michael Labriola, Matthew Boles, and
          <string-name>
            <given-names>James</given-names>
            <surname>Talbot</surname>
          </string-name>
          .
          <article-title>Adobe Flex 3: training from the source</article-title>
          .
          <source>Adobe Press, rst edition</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [19]
          <string-name>
            <surname>Robert</surname>
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Clemen</surname>
          </string-name>
          and
          <string-name>
            <surname>Robert L. Winkler</surname>
          </string-name>
          .
          <article-title>Combining probability distributions from experts in risk analysis</article-title>
          .
          <source>Risk Analysis</source>
          ,
          <volume>19</volume>
          :
          <fpage>187</fpage>
          {
          <fpage>203</fpage>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>E.N.</given-names>
            <surname>Herness</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.H.</given-names>
            <surname>High</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.R.</given-names>
            <surname>McGee</surname>
          </string-name>
          .
          <article-title>Websphere application server: a foundation for on demand computing</article-title>
          .
          <source>IBM Syst. J.</source>
          ,
          <volume>43</volume>
          (
          <issue>2</issue>
          ):
          <volume>213</volume>
          {
          <fpage>237</fpage>
          ,
          <string-name>
            <surname>April</surname>
          </string-name>
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [21]
          <article-title>Richard Soley and the OMG Sta Strategy Group</article-title>
          .
          <article-title>Model-driven architecture</article-title>
          . http: //www.omg.org/~soley/mda.html,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>Roberto</given-names>
            <surname>Chinnici</surname>
          </string-name>
          .
          <article-title>Java APIs for XML based RPC (JSR 101)</article-title>
          . http://jcp.org/aboutJava/ communityprocess/first/jsr101/, October 28,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [23]
          <string-name>
            <surname>Frank</surname>
            <given-names>Budinsky</given-names>
          </string-name>
          , Stephen A.
          <string-name>
            <surname>Brodsky</surname>
          </string-name>
          , and Ed Merks.
          <source>Eclipse Modeling Framework. Pearson Education</source>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [24]
          <string-name>
            <surname>Marek</surname>
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Druzdzel</surname>
          </string-name>
          . Smile:
          <article-title>Structural modeling, inference, and learning engine and genie: a development environment for graphical decisiontheoretic models</article-title>
          .
          <source>In Proceedings of the sixteenth national conference on Arti cial intelligence</source>
          and
          <article-title>the eleventh Innovative applications of arti cial intelligence conference innovative applications of arti cial intelligence</article-title>
          ,
          <source>AAAI '99/IAAI '99</source>
          , pages
          <fpage>902</fpage>
          {
          <fpage>903</fpage>
          , Menlo Park, CA, USA,
          <year>1999</year>
          . American Association for Arti cial Intelligence.
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>Andrew</given-names>
            <surname>Speirs-Bridge</surname>
          </string-name>
          , Fiona Fidler,
          <string-name>
            <surname>Marissa</surname>
            <given-names>McBride</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>Louisa</given-names>
            <surname>Flander</surname>
          </string-name>
          , Geo Cumming, and
          <string-name>
            <given-names>Mark</given-names>
            <surname>Burgman</surname>
          </string-name>
          .
          <article-title>Reducing overcon dence in the interval judgments of experts</article-title>
          .
          <source>Risk Analysis</source>
          ,
          <volume>30</volume>
          (
          <issue>3</issue>
          ):
          <volume>512</volume>
          {
          <fpage>23</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A. H.</given-names>
            <surname>Lau</surname>
          </string-name>
          and
          <string-name>
            <given-names>T. Y.</given-names>
            <surname>Leong</surname>
          </string-name>
          .
          <article-title>Probes: a framework for probability elicitation from experts</article-title>
          .
          <source>In Proceedings of the AMIA Symposium. American Medical Informatics Association</source>
          ,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>