Screen Link:

We’re being asked to calculating P(Spam^c | w1,w2,w3,w4). This should be

(P(Spam^c) * P(w1,w2,w3,w4 | Spam^C)) / P(w1,w2,w3,w4), right? It’s only for the sake of easier computation that we are only calculating the numerator since it’s not necessary to calculate the dominator for the purposes of the algorithm to be learned in this mission.

I’m just double checking here, since it’s a little confusing when Q1 asks for P(Spam^c | w1,w2,w3,w4). I read that as “probability of not spam, given words 1,2,3 & 4”. The sufficient answer, however, isn’t actually P(Spam^c | w1,w2,w3,w4)

Follow-up Q:

If my reasoning here is correct, if I did want the true probability, I would divide the result by P(w1,w2,w3,w4). I imagine P(w1,w2,w3,w4) = P(w1) * P(w2) * P(w3) * P(w4), but I am not 100% sure about that…