Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Hypercausality, randomisation, and local and global independence

Tools
- Tools
+ Tools

UNSPECIFIED (2004) Hypercausality, randomisation, and local and global independence. In: 1st European Workshop on Probabilistic Graphical Models (PGM 02), NOV, 2002, Cuenca, SPAIN.

Full text not available from this repository.

Abstract

In this paper we define the multicausal essential graph. Such graphical model demands further properties an equivalence class of Bayesian networks (BNs). In particular, each BN in an equivalence class is assumed to be causal in a stronger version of the manipulation causality of Spirtes et al (1993). In practice, the probabilities of any causal Bayesian network (CBN) will usually need to be estimated. To estimate the conditional probabilities in BNs it is common to assume local and global independence. The first result we prove in this paper is that if the BN is believed to be causal in a sufficiently strong sense i.e., is hypercausal, then it is necessary to make the assumption of local and global prior independence. Our second theorem develops this result. We give a characterisation of prior distributions sympathetic to causal hypotheses on all BNs in the equivalence class defined by an essential graph. We show that such strongly causally compatible priors satisfy a generalisation of the Geiger and Heckerman (1997) condition. In a special case when the essential graph is undirected, this family of prior distributions reduces to the Hyper-Dirichlet family, originally introduced by Dawid and Lauritzen (1993) as a prior family for decomposable graphical models.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Q Science > QA Mathematics
Series Name: STUDIES IN FUZZINESS AND SOFT COMPUTING
Journal or Publication Title: ADVANCES IN BAYESIAN NETWORKS
Publisher: SPRINGER-VERLAG BERLIN
ISBN: 3-540-20876-3
ISSN: 1434-9922
Editor: Gamez, JA and Moral, S and Salmeron, A
Date: 2004
Volume: 146
Number of Pages: 18
Page Range: pp. 1-18
Publication Status: Published
Title of Event: 1st European Workshop on Probabilistic Graphical Models (PGM 02)
Location of Event: Cuenca, SPAIN
Date(s) of Event: NOV, 2002
URI: http://wrap.warwick.ac.uk/id/eprint/7674

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us