Independence for full conditional measures, graphoids and bayesian networks

Abstract

This paper examines definitions of independence for events and variables in the context of full conditional measures; that is, when conditional probability is a primitive notion and conditioning is allowed on null events. Several independence concepts are evaluated with respect to graphoid properties; we show that properties of weak union, contraction and intersection may fail when null events are present. We propose a concept of “full” independence, characterize the form of a full conditional measure under full independence, and suggest how to build a theory of Bayesian networks that accommodates null events.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Analytics

Added to PP
2009-08-23

Downloads
34 (#467,440)

6 months
1 (#1,461,875)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Teddy Seidenfeld
Carnegie Mellon University

References found in this work

No references found.

Add more references