A new inference axiom for probabilistic conditional independence

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we present a hypergraph-based inference method for conditional independence. Our method allows us to obtain several interesting results on graph combination. In particular, our hypergraph approach allows us to strengthen one result obtained in a conventional graph-based approach. We also introduce a new inference axiom, called combination, of which the contraction axiom is a special case.

Cite

CITATION STYLE

APA

Butz, C. J., Wong, S. K. M., & Wu, D. (2003). A new inference axiom for probabilistic conditional independence. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2671, pp. 568–574). Springer Verlag. https://doi.org/10.1007/3-540-44886-1_52

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