Recursive Bayesian estimation, update. You have observations like for example, it has a beak, it has feathers, it swims, etc. You want to figure the probability of it being a duck. You know about the definition of a duck with information like p(has_features | it's_a_duck) but you want to figure out probability it's_a_duck given all observations up until now, making one observation at a time.
Recursive Bayesian estimation turns information like p(has_features | it's_a_duck) into what you want in this case. If you already knew probability it's_a_duck given any sequence of observations, you wouldn't need this.
From Wikipedia:
(1)
p(xk | zk)
= c p(zk | xk) p(xk | zk-1)
We just ignore the constant c.
p(xk | zk)
= p(zk | xk) p(xk | zk-1)
This is recursive. You could write it in words as:
current_estimate = p(zk | xk) estimate_based_on_last_observation
Now an example:
p(x3 | z3)
= p(z3 | x3) p(x3 | z2)
Need to find p(x3 | z2)
p(x3 | z2) = p(z2 | x3) p(x3 | z1)
Need to find p(x3 | z1)
Equation (1) no longer applies, but you could say:
p(x3 | z1)
= p(z1 | x3) p(x3)
p(xk | zk)
in terms of p(zi | x3)
And we assume these are known. If the hypothesis is that it's a duck. z1 and z2 are pieces of evidence picked up along the way that it's duck or not. Suppose z1 is beak observation. This p(z1 | x3) would be probability of beak given it's a duck, like almost 1.
No comments:
Post a Comment