arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0607014cs.ITmath.IT
收藏

Good-Turing估计的强相合性

Strong Consistency of the Good-Turing Estimator

Aaron B. Wagner, Pramod Viswanath, Sanjeev R. Kulkarni

摘要:

我们考虑的问题,估计的总概率的所有符号出现在一个字符串中的一个给定的频率i.i.d.未知分布的随机变量我们专注于政权的块长度很大,但没有符号经常出现在字符串中。这是通过允许分布随块长度变化来实现的。根据一个自然的收敛假设的序列的基本分布,我们表明,总概率收敛到一个确定性的限制,我们的特点。然后我们证明了Good-Turing全概率估计是强相合的。

英文摘要:

We consider the problem of estimating the total probability of all symbols that appear with a given frequency in a string of i.i.d. random variables with unknown distribution. We focus on the regime in which the block length is large yet no symbol appears frequently in the string. This is accomplished by allowing the distribution to change with the block length. Under a natural convergence assumption on the sequence of underlying distributions, we show that the total probabilities converge to a deterministic limit, which we characterize. We then show that the Good-Turing total probability estimator is strongly consistent.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑