JoeyDVivre Wrote:
——————————————————-
> So the first thing is that C.I.’s and Chebyshev
> are very different animals. A C.I. is a
> statistical estimate based on data. Chebyshev is
> a probabilistic bound not used in any data
> analysis that I have ever seen. Why they are
> presenting a probabilistic bound in CFA I is
> beyond me, except that it is a neat result.
>
> So start with some probability distribution and
> suppose that it has a mean and a standard
> deviation (not true of all distributions).
> Chebyshev says you don’t need to know anymore than
> that to know that at least 75% of the
> “observations” are within 2 s.d.’s of the mean
> (and more generally that at least 1 - 1/k^2 are
> within k s.d.’s of the mean). Note that Chebyshev
> has nothing to do with normality or any other
> shape assumption.
>
> A C.I. is an estimator of some parameter, often a
> mean of a distribution. Usually these are based
> on some assumption of normality or the central
> limit theorem. So if I ask you to estimate the
> mean of a distribution, you sample from the
> distribution, calculate X-bar and tell me that
> your belief is that the mean of the distribution
> is “about X-bar”. That’s just as satisfying to me
> as when I would ask my Mom when dinner was coming
> and she would say “about 6 PM”. I would start
> emptying the contents of the refrigerator onto the
> kitchen floor until my mother gave me a more
> precise answer like “With 95% confidence, dinner
> will be between 5:45 PM and 6:15 PM”. That’s a
> C.I..
Joey, can you please explain in greater detail what a probabilistic bound is? Is it related to the proof of the Chebyshev inequality or something?