Weighted finite population sampling to maximize entropy
最大化熵的有限总体加权抽样AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于有限总体抽样设计理论,未提供面板、因果推断或其他细分的直接证据。
反馈分类问题最大化熵的有限总体加权抽样AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Attention is drawn to a method of sampling a finite population of N units with unequal probabilities and without replacement. The method was originally proposed by Stern & Cover (1989) as a model for lotteries. The method can be characterized as maximizing entropy given coverage probabilities πi, or equivalently as having the probability of a selected sample proportional to the product of a set of ‘weights’ wi. We show the essential uniqueness of the wi given the πi. We present two methods for stepwise selection of sampling units, and corresponding schemes for removal of units that can be used in connection with sample rotation. Inclusion probabilities of any order can be written explicitly in closed form. Second-order inclusion probabilities πij satisfy the condition O < πij < πiπj, which guarantees Yates & Grundy‘s variance estimator to be unbiased, definable for all samples and always nonnegative for any sample size.