Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Using Weak Prior Information on Structures to Learn Bayesian Networks
verfasst von : Massimiliano Mascherini, Federico M. Stefanini
Erschienen in: Knowledge-Based Intelligent Information and Engineering Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Most of the approaches developed in the literature to elicit the a-priori 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.