Hx part c boost by inspection 10 points as you become

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

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: TA's, Martin, happens to walk by and sees your answer to part A1. He reminds you why the boosting algorithm works and then tells you that there is no reason to actually run boosting on this dataset. A boosted classifier of the form: H(x) = Sign[h1(x) + h2(x) + h3(x)] can be found which solves the problem. What three classifiers {h1, h2, h3} is Martin referring to, and why is the resulting H(x) guaranteed to classify all of the points correctly? 9 Tear off sheets. You need not hand these in. 10 K , =⋅ u v uv YES NO 2 K , =⋅ 1 uv uv YES K , = e uv YES NO −∣ −∣2 / 2 uv NO 11 ID Name Friend Species Has Magic Part of the Fellowship Has/Had a Length of ring of power hair (feet) 1 Gandalf Yes Wizard Yes Yes No 2 2 Sarumon No Wizard Yes No No 2.5 3 Sauron No Wizard Yes No Yes 0 4 Legolas Yes Elf Yes Yes No 2 5 Tree-Beard Yes Ent No No No 0 6 Sam Yes Hobbit No Yes No 0.25 7 Elrond Yes Elf Yes No Yes 2 8 Gollum No Hobbit No No Yes 1 9 Aragorn Yes Man No Yes No 0.75 10 Witch-king No of Angmar Man Yes No Yes 2.5 12...
View Full Document

Ask a homework question - tutors are online