Technical properties of Ranked Nodes Method

2021/07/27 by Pekka Laitila, Laitila, Pekka, Kai Virtanen +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Methodology (stat.ME) #Target Tracking and Data Fusion in Sensor Networks #stat.ME

paper · pdf · doi:10.48550/arxiv.2107.12747

39 pages, 3 figures

arxiv created 2021/07/27 · openalex publication_date 2021/07/27 · arxiv updated 2021/07/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Artificial intelligence: a modern approach

Related

• On tensor rank of conditional probability tables in Bayesian networks
• Generating Conditional Probabilities for Bayesian Networks: Easing the Knowledge Acquisition Problem
• A physical model for efficient ranking in networks
• Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
• A Score-and-Search Approach to Learning Bayesian Networks with Noisy-OR Relations