Sufficient Statistics and the Factorization Theorem
Вставка
- Опубліковано 3 бер 2024
- This video teaches you all about sufficient statistics - what they are, why they're important and useful, and how to find them using the factorization theorem, with examples for the Binomial and Poisson distribution.
Thanks for the straightforward explanation!! Now I can understand why "sufficient" is sufficient!
Great explanation
Really impressed with your videos, keep on making more!
Thank you, many more to come!
Thank you very much!!!
Very clear, usefull and understandable
This is a great, intuitive explanation. Thanks!
Thanks, glad you found it helpful!
This is a fantastic explanation, clear, simple, and short :)
Thank you!
Thank you!
Thanks for watching!
It was awesome please continue 🔥
thank you soooooo much. this was so helpful for my college final in mathematical statistics at Texas a&m!!!! you are incredibly gifted!
Thanks, Mary, I'm glad it helped!
Keep up the good work!
Thank you, lots more to come!
thank u so much man u explained it so so well
Thanks, glad you enjoyed it!
great!
thank u thank u thank u
Thanks for the video, I'm not grasping only one concept: why is the summation of X_i sufficient in the binomial case (I assume this means we won't need the number of trials)? Shouldn't we know the number of successes with respect to the total trials? For example of course the summation of X_i = 3 where n=5 and where n=100 should give different probabilities
Yes, you're totally correct. We do need to know the number of trials, but that's usually known to us already, so in that case the # of successes is equivalent to the proportion of successes because we can just divide by the (already known) number of trials. (If the number of trials were *also* an unknown parameter that we were trying to learn about, then the number of successes alone would not be sufficient for learning about the probability of success). Let me know if that makes sense or if I can try to clarify further.
@@briangreco2718 yep that's more than 🥁🥁🥁sufficient! Thanks again
Great work.Thank you