ML_HW1_solution_LIU_Gang

ML_HW1_solution_LIU_Gang - CS6375 Machine Learning Homework...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
CS6375 Machine Learning Homework 1 Gang LIU SID: 11458407 Jan.30, 2009 1) Solution: Re-arrange the data to handle the question: No. Attr1 Attr2 Attr3 Attr4 Class 1 a 1 c -1 1 2 b 0 c -1 1 3 a 0 c 1 1 4 b 1 c 1 1 5 b 0 c 1 2 6 a 0 d -1 2 7 a 1 d -1 2 8 b 1 c -1 2 By the definitions of entropy and information gain, i 2i 1 H= -P log P n i = we can get the following result.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 height = 4 Attr 3=c? Attr 1=a? Attr 2=1? Attr 4=-1? Attr 4=-1? 1, 3 5 2 6, 7 4 8 by matlab command, nodes = [0 1 1 2 2 5 5 6 6 7 7];treeplot(nodes) We can get the above figure. The green rectangle stands for Class 1, the purple one stands for Class 2. 2. [5 points] Problem 3.1 (b)(c) in T. Mitchell book. Give decision trees to represent the following Boolean functions: (b) [] A BC ∪∩ (c) A XOR B Solution: (b)
Background image of page 2
(c) A XOR B : Truth table of exclusive or. 3. [10 points] Paper critique. Read the paper: A comparative analysis of methods for pruning decision trees, F. Esposito, D. Malerba, and G. Semeraro, in IEEE Transactions on Pattern Analysis and Machine Learning. 1997.
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

ML_HW1_solution_LIU_Gang - CS6375 Machine Learning Homework...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online