CS 246 Quiz: CS246 Quiz 7
9 Jan 2019
School
Department
Course
Professor
Document Summary
Robert: home page, handouts, tutorials, homeworks, lab projects, reports, class administration, question bank, log out. You can attempt to answer the questions as many times as you like. *last* submission gets saved into our records (that is, once you get a perfect score, don"t submit again with a bad one): we consider the following dataset (+ means positive example and - negative example): For instance, the number of positive examples that have attribute a is 64 and the number of negative example that have neither a or b is 128. Build a decision tree using information gain as a way of deciding which attribute to use first (there are only 2 attributes here, a and b). You will need to compute information gain (use log in base 2). Let us use the following notation: - ig_a (resp. Ig_b) = information gain obtained when using a (resp. B) to split the root node - ig_with_a (resp.
