Answer Happy

MAP Learning
In the data of Candy Example of Chap. 20 (slide #6), 6 candies
are unwrapped one by one and a flavor of each candy is as follows:
d1 = lime, d2 = cherry, d3= cherry, d4 = lime, d5 = cherry, d6 =
cherry.
You have to show the essential
computational steps if you compute them manually or using an excel
sheet. Otherwise, write a program to compute them. – Refer to the
handout of Candy Example on the blackboard and follow the
submission instruction.
<P(d7= cherry |
hMAP), P(d7= lime |
hMAP) > based on
hMAP in (1), and give a
prediction on the flavor of the 7th candy.
based on hMAP in (1), and give a prediction on the flavor of the
7th candy.
Here is slide #6
Example • Hypotheses: Suppose there are five kinds of bags of candies: 10% are h;: 100% cherry candies • 20% are hz: 75% cherry candies + 25% lime candies • 40% are hz: 50% cherry candies + 50% lime candies • 20% are ha: 25% cherry candies + 75% lime candies • 10% are h;: 100% lime candies 5 • Data: Then, we observe candies drawn from some bag: • Prediction: What kind of bag is it? What flavor will the next candy be? -- to infer a theory of its world.