Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Using the structure of d-connecting paths as a qualitative measure of the strength of dependence
Sanjay Chaudhari, Thomas Richardson
Abstract:
Pearls concept OF a d - connecting path IS one OF the foundations OF the modern theory OF graphical models : the absence OF a d - connecting path IN a DAG indicates that conditional independence will hold IN ANY distribution factorising according TO that graph. IN this paper we show that IN singly - connected Gaussian DAGs it IS possible TO USE the form OF a d - connection TO obtain qualitative information about the strength OF conditional dependence.More precisely, the squared partial correlations BETWEEN two given variables, conditioned ON different subsets may be partially ordered BY examining the relationship BETWEEN the d - connecting path AND the SET OF variables conditioned upon
Keywords:
Pages: 116-123
PS Link:
PDF Link: /papers/03/p116-chaudhari.pdf
BibTex:
@INPROCEEDINGS{Chaudhari03,
AUTHOR = "Sanjay Chaudhari and Thomas Richardson",
TITLE = "Using the structure of d-connecting paths as a qualitative measure of the strength of dependence",
BOOKTITLE = "Proceedings of the Nineteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-03)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "2003",
PAGES = "116--123"
}


hosted by DSL   •   site info   •   help