Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Graphoids: a qualitative framework for probabilistic inference
Graphoids: a qualitative framework for probabilistic inference
Extreme convex set functions with many nonnegative differences
Discrete Mathematics
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
Journal of the ACM (JACM)
Conditional Independences among Four Random Variables III: Final Conclusion
Combinatorics, Probability and Computing
Characterizations of decomposable dependency models
Journal of Artificial Intelligence Research
A framework for linear information inequalities
IEEE Transactions on Information Theory
Lengths of Semigraphoid Inferences
Annals of Mathematics and Artificial Intelligence
Conditional Independences among Four Random Variables III: Final Conclusion
Combinatorics, Probability and Computing
On characterizing inclusion of Bayesian networks
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Conditional independences in gaussian vectors and rings of polynomials
WCII'02 Proceedings of the 2002 international conference on Conditionals, Information, and Inference
| Hi-index | 0.01 |
Directed acyclic graphs (DAG’s) and, more generally, chain graphs have in recent years been widely used for statistical modelling. Their Gibbs and Markov properties are now well understood and are exploited, e.g., in reducing the complexity ...