An algorithm for robust relative influence values elicitation (ARRIVE)

S. E. Hegazy; C. D. Buckingham

doi:10.1109/ICCGI.2008.30

An algorithm for robust relative influence values elicitation (ARRIVE)

S. E. Hegazy, C. D. Buckingham

Computer Science Research Group

Research output: Chapter in Book/Published conference output › Conference publication

Abstract

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.

Original language	English
Title of host publication	Proc. - The 3rd Int. Multi-Conf. Computing in the Global Information Technology, ICCGI 2008 in Conjunction with ComP2P 2008: The 1st Int. Workshop on Computational P2P Networks: Theory and Practice
Pages	91-96
Number of pages	6
DOIs	https://doi.org/10.1109/ICCGI.2008.30
Publication status	Published - 26 Sept 2008
Event	3rd International Multi-Conference on Computing in the Global Information Technology, ICCGI 2008 - Athens, United Kingdom Duration: 27 Jul 2008 → 1 Aug 2008

Conference

Conference	3rd International Multi-Conference on Computing in the Global Information Technology, ICCGI 2008
Country/Territory	United Kingdom
City	Athens
Period	27/07/08 → 1/08/08

Access to Document

10.1109/ICCGI.2008.30

Cite this

Hegazy, S. E., & Buckingham, C. D. (2008). An algorithm for robust relative influence values elicitation (ARRIVE). In Proc. - The 3rd Int. Multi-Conf. Computing in the Global Information Technology, ICCGI 2008 in Conjunction with ComP2P 2008: The 1st Int. Workshop on Computational P2P Networks: Theory and Practice (pp. 91-96). Article 4591351 https://doi.org/10.1109/ICCGI.2008.30

@inproceedings{3e85efd88dd3420a9100f2b7ddd93405,

title = "An algorithm for robust relative influence values elicitation (ARRIVE)",

abstract = "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.",

author = "Hegazy, {S. E.} and Buckingham, {C. D.}",

year = "2008",

month = sep,

day = "26",

doi = "10.1109/ICCGI.2008.30",

language = "English",

isbn = "9780769532752",

pages = "91--96",

booktitle = "Proc. - The 3rd Int. Multi-Conf. Computing in the Global Information Technology, ICCGI 2008 in Conjunction with ComP2P 2008: The 1st Int. Workshop on Computational P2P Networks: Theory and Practice",

note = "3rd International Multi-Conference on Computing in the Global Information Technology, ICCGI 2008 ; Conference date: 27-07-2008 Through 01-08-2008",

}

Hegazy, SE & Buckingham, CD 2008, An algorithm for robust relative influence values elicitation (ARRIVE). in Proc. - The 3rd Int. Multi-Conf. Computing in the Global Information Technology, ICCGI 2008 in Conjunction with ComP2P 2008: The 1st Int. Workshop on Computational P2P Networks: Theory and Practice., 4591351, pp. 91-96, 3rd International Multi-Conference on Computing in the Global Information Technology, ICCGI 2008, Athens, United Kingdom, 27/07/08. https://doi.org/10.1109/ICCGI.2008.30

An algorithm for robust relative influence values elicitation (ARRIVE). / Hegazy, S. E.; Buckingham, C. D.
Proc. - The 3rd Int. Multi-Conf. Computing in the Global Information Technology, ICCGI 2008 in Conjunction with ComP2P 2008: The 1st Int. Workshop on Computational P2P Networks: Theory and Practice. 2008. p. 91-96 4591351.

Research output: Chapter in Book/Published conference output › Conference publication

TY - GEN

T1 - An algorithm for robust relative influence values elicitation (ARRIVE)

AU - Hegazy, S. E.

AU - Buckingham, C. D.

PY - 2008/9/26

Y1 - 2008/9/26

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=52249124127&partnerID=8YFLogxK

U2 - 10.1109/ICCGI.2008.30

DO - 10.1109/ICCGI.2008.30

M3 - Conference publication

AN - SCOPUS:52249124127

SN - 9780769532752

SP - 91

EP - 96

BT - Proc. - The 3rd Int. Multi-Conf. Computing in the Global Information Technology, ICCGI 2008 in Conjunction with ComP2P 2008: The 1st Int. Workshop on Computational P2P Networks: Theory and Practice

T2 - 3rd International Multi-Conference on Computing in the Global Information Technology, ICCGI 2008

Y2 - 27 July 2008 through 1 August 2008

ER -

An algorithm for robust relative influence values elicitation (ARRIVE)

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this