This preview shows page 1. Sign up to view the full content.
Unformatted text preview: to mchang21@uiuc.edu . 1. [Tree Dependent Distributions] Assume an undirected tree T obtained by the algorithm described in class for learning tree dependent distributions. We would like to show that the step of directing the tree by choosing an arbitrary node is okay. (a) State exactly what is meant by the statement the two directed trees obtained from T are the same . (b) Show that no matter which node in T is chosen as a root for the direction stage, the resulting directed trees are all the same (based on your deFnition above). 1...
View
Full
Document
This note was uploaded on 04/23/2010 for the course COMPUTER S cs 446 taught by Professor Ahuja during the Fall '08 term at University of Illinois at Urbana–Champaign.
 Fall '08
 ahuja
 Machine Learning

Click to edit the document details