Using weak prior information on structures to learn Bayesian networks

Authors:
Massimiliano Mascherini;Federico M. Stefanini
Affiliations:
European Commission, Joint Research Centre, Ispra, VA, Italy;Dipartimento di Statistica "G. Parenti", Universita' di Firenze, Florence, Italy
Venue:
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part I
Year:
2007

Citing 3
Cited 1

Theory refinement on Bayesian networks

Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Structure Learning of Bayesian Networks by Genetic Algorithms: A Performance Analysis of Control Parameters

IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to Bayesian Networks

Introduction to Bayesian Networks

Review: learning bayesian networks: Approaches and issues

The Knowledge Engineering Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the approaches developed in the literature to elicit the apriori distribution on Directed Acyclic Graphs (DAGs) require a full specification of graphs. Nevertheless, expert's prior knowledge about conditional independence relations may be weak, making the elicitation task troublesome. Moreover, the detailed specification of prior distributions for structural learning is NP-Hard, making the elicitation of large networks impractical. This is the case, for example, of gene expression analysis, in which a small degree of graph connectivity is a priori plausible and where substantial information may regard dozens against thousands of nodes. In this paper we propose an elicitation procedure for DAGs which exploits prior knowledge on network topology, and that is suited to large Bayesian Networks. Then, we develop a new quasi-Bayesian score function, the P-metric, to perform structural learning following a score-and-search approach.