...
首页> 外文期刊>Sequential analysis >A Note on a Subset Selection Procedure for the Most Probable Multinomial Event
【24h】

A Note on a Subset Selection Procedure for the Most Probable Multinomial Event

机译:关于最可能的多项式事件的子集选择过程的注释

获取原文
获取原文并翻译 | 示例
           

摘要

Panchapakesan (1971) proposed and investigated a subset selection procedure for selecting the most probable cell in a multinomial distribution on k ( ≥ 2) cells. He showed that the least favorable configuration (LFC) for the probability of a correct selection (PCS) is that of equal cell-probabilities. He showed that this result holds exactly for k = 2 and asymptotically for k ≥ 3. Later, Chen (1986) and Liu and Lin (1991) showed that the result holds exactly for k ≥ 3. Their proofs involve differentiation of type-2 Dirichlet integrals with the restriction that the cell-probabilities add up to unity. We now give a fairly simple proof of this result by obtaining the PCS as a single integral involving the gamma distribution. This was the proof behind the claim of the LFC result made without details in the abstract by Panchapakesan (1973).
机译:Panchapakesan(1971)提出并研究了一个子集选择程序,该程序用于选择k(≥2)个单元的多项式分布中最可能的单元。他表明,对于正确选择(PCS)的概率而言,最不利的配置(LFC)是相等的单元格概率。他证明了该结果对于k = 2完全成立,对于k≥3渐近成立。后来,Chen(1986)和Liu and Lin(1991)证明对k≥3完全成立。他们的证明涉及类型2的微分。 Dirichlet积分具有单元格概率加起来等于1的限制。现在,我们通过获得PCS作为涉及伽玛分布的单个积分,给出了关于此结果的相当简单的证明。这是Panchapakesan(1973)在摘要中没有详细说明LFC结果的主张的证据。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号