By Topic

An Algorithm for Robust Relative Influence Values Elicitation (ARRIVE)

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

2 Author(s)
Hegazy, S.E. ; Sch. of Eng. & Appl. Sci., Aston Univ., Birmingham ; Buckingham, C.D.

This paper proposes an approach to solving node weightings in a tree structure. The tree represents expertise used to quantify risks associated with mental-health problems and it is incorporated within a Web-based decision support system called GRiST. The aim of the algorithm is to find the set of relative node weightings in the tree that helps GRiST simulate the clinical risk judgements given by mental-health experts. The results show that a very large number of nodes (several thousand for GRiST) can have their weights calculated from the clinical judgements associated with a few hundred cases (200 for GRiST). This greatly reduces the experts' elicitation tasks by ensuring they do not need to provide their own estimation of node weights throughout the tree. The approach has the potential for reducing elicitation load in similar knowledge-engineering domains where relative weightings of node siblings are part of the parameter space.

Published in:

Computing in the Global Information Technology, 2008. ICCGI '08. The Third International Multi-Conference on

Date of Conference:

July 27 2008-Aug. 1 2008