A new inference axiom for probabilistic conditional independence

Authors:
Cory J. Butz;S. K. Michael Wong;Dan Wu
Affiliations:
Department of Computer Science, University of Regina, Regina, SK, Canada;Department of Computer Science, University of Regina, Regina, SK, Canada;Department of Computer Science, University of Regina, Regina, SK, Canada
Venue:
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Year:
2003

Citing 6
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
A graph-based inference method for conditional independence

Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Probabilistic Reasoning in Multi-Agent Systems: A Graphical Models Approach

Probabilistic Reasoning in Multi-Agent Systems: A Graphical Models Approach
Constructing the Dependency Structure of a Multiagent Probabilistic Network

IEEE Transactions on Knowledge and Data Engineering
On the implication problem for probabilistic conditional independency

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

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.