A Study of Conditional Independence Change in Learning Probabilistic Network

Authors:
Tao Lin;Yichao Huang
Affiliations:
-;-
Venue:
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
Year:
2000

Citing 6
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
A “Microscopic” Study of Minimum Entropy Search in Learning Decomposable Markov Networks

Machine Learning
Probabilistic Networks and Expert Systems

Probabilistic Networks and Expert Systems
A Guide to the Literature on Learning Probabilistic Networks from Data

IEEE Transactions on Knowledge and Data Engineering
Learning equivalence classes of Bayesian network structures

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the change for the conditional independence set in learning Probabilistic Network based on markov property. They are generalized into several cases for all of possible changes. We show that these changes are sound and complete. Any structure learning methods for the Decomposiable Markov Network and Bayesian Network will fall into these cases. This study indicates which kind of domain model can be learned and which can not. It suggests that prior knowledge about the problem domain decides the basic frame for the future learning.