hw7 - to mchang21@uiuc.edu . 1. [Tree Dependent...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS446: Pattern Recognition and Machine Learning Fall 2009 Problem Set 7 Handed Out: December 3, 2009 Due: December 8, 2009 Feel free to talk to other members of the class in doing the homework. I am more concerned that you learn how to solve the problem than that you demonstrate that you solved it entirely on your own. You should, however, write down your solution yourself. Please try to keep the solution brief and clear. Feel free to send me email or come to ask questions regarding this handout or conceptual issues. Please, no hard copy solutions. The homework is due at 4:00 pm on the due date. Email your write-up to the TA. Please put < userid > CS446 hw7 submission” as the subject line of the email when you submit your homework
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

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.

Ask a homework question - tutors are online