Towards Optimal Learning of Chain Graphs

Details Towards Optimal Learning of Chain Graphs Towards Optimal Learning of Chain Graphs

2011-09-25

arxiv.org/abs/1109.5404v1

Statistics

Machine Learning

Scientific paper

In this paper, we extend Meek's conjecture (Meek 1997) from directed and acyclic graphs to chain graphs, and prove that the extended conjecture is true. Specifically, we prove that if a chain graph H is an independence map of the independence model induced by another chain graph G, then (i) G can be transformed into H by a sequence of directed and undirected edge additions and feasible splits and mergings, and (ii) after each operation in the sequence H remains an independence map of the independence model induced by G. Our result has the same important consequence for learning chain graphs from data as the proof of Meek's conjecture in (Chickering 2002) had for learning Bayesian networks from data: It makes it possible to develop efficient and asymptotically correct learning algorithms under mild assumptions.

Affiliated with

Also associated with

No associations

Rating

Towards Optimal Learning of Chain Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards Optimal Learning of Chain Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Optimal Learning of Chain Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-685307