Technical properties of Ranked Nodes Method
Pekka Laitila, Kai Virtanen

TL;DR
This paper analyzes the ranked nodes method (RNM) for constructing Bayesian network tables, providing analytical and experimental insights mainly for cases with parent and child nodes sharing the same ordinal states.
Contribution
It offers new analytical and experimental results on RNM, highlighting properties useful for its future development in Bayesian network modeling.
Findings
RNM properties support future elaboration
Results focus on nodes with identical ordinal states
Analytical and experimental validation of RNM
Abstract
This paper presents analytical and experimental results on the ranked nodes method (RNM) that is used to construct conditional probability tables for Bayesian networks by expert elicitation. The majority of the results are focused on a setting in which RNM is applied to a child node and parent nodes that all have the same amount discrete ordinal states. The results indicate on RNM properties that can be used to support its future elaboration and development.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTarget Tracking and Data Fusion in Sensor Networks
