Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
An Extended Relational Data Model For Probabilistic Reasoning
Journal of Intelligent Information Systems
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Constructing the Dependency Structure of a Multiagent Probabilistic Network
IEEE Transactions on Knowledge and Data Engineering
Construction of a Non-redundant Cover for Conditional Independencies
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Theory of Relational Databases
Theory of Relational Databases
On the implication problem for probabilistic conditional independency
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Maximal prime subgraph decomposition of Bayesian networks: A relational database perspective
International Journal of Approximate Reasoning
Triangulation of Bayesian networks with recursive estimation of distribution algorithms
International Journal of Approximate Reasoning
Subexponential parameterized algorithm for minimum fill-in
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
In this paper, we study the problem of triangulation of Bayesian networks from a relational database perspective. We show that the problem of triangulating a Bayesian network is equivalent to the problem of identifying a maximal subset of conflict free conditional independencies. Several interesting theoretical results regarding triangulating Bayesian networks are obtained from this perspective.