By Topic

A Myopic Approach to Ordering Nodes for Parameter Elicitation in Bayesian Belief Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bhattacharjya, D. ; Dept. of Bus. Analytics & Math. Sci., IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA ; Deleris, L.A. ; Ray, B.

Building Bayesian belief networks in the absence of data involves the challenging task of eliciting conditional probabilities from experts to parameterize the model. In this paper, we develop an analytical method for determining the optimal order for eliciting these probabilities. Our method uses prior distributions on network parameters and a novel expected proximity criteria, to propose an order that maximizes information gain per unit elicitation time. We present analytical results when priors are uniform Dirichlet; for other priors, we find through experiments that the optimal order is strongly affected by which variables are of primary interest to the analyst. Our results should prove useful to researchers and practitioners involved in belief network model building and elicitation.

description of the attached tkde-gagraphic-72.jpg linked by @xlink:href description of the attached tkde-gagraphic-72.jpg linked by @xlink:href

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:26 ,  Issue: 5 )