Revision as of 07:58, 28 November 2008 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits →Odds-Theorem: \dots ← Previous edit		Revision as of 07:58, 28 November 2008 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits →Definitions Next edit →
Line 25: == Definitions == Consider a sequence of n independent events. Associate with this sequence another sequence <math> I_1,\, I_2,\, ~~...~~\dots ,\, I_n </math> with values 1 or 0. Here <math> \,I_k =1</math> stands for the event that the kth observation is interesting (as defined by the decision maker), and <math>\, I_k=0</math> for non-interesting. Let <math> \,p_k = P( \,I_k\,=1)</math> be the probability that the kth event is interesting. Further let

Odds algorithm: Difference between revisions