Learning belief network structure from data under causal insufficiency

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Hidden variables are well known sources of disturbance when recovering belief networks from data based only on measurable variables. Hence models assuming existence of hidden variables are under development. This paper presents a new algorithm exploiting the results of the known CI algorithm of Spirtes, Glymour and Scheines [4]. CI algorithm produces partial causal structure from data indicating for some variables common unmeasured causes. We claim that there exist belief network models which (1) have connections identical with those of CI output, (2) have edge orientations identical with CI (3) have no other latent variables than those indicated by CI, and (4) and the same time fit the data. We present a non-deterministic algorithm generating the whole family of such belief networks.

Cite

CITATION STYLE

APA

Klopotek, M. A. (1994). Learning belief network structure from data under causal insufficiency. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 784 LNCS, pp. 379–382). Springer Verlag. https://doi.org/10.1007/3-540-57868-4_78

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free