Nonparametric Maximum Likelihood Estimation Based on Ranked Set Samples
基于排序集样本的非参数最大似然估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要侧重特殊抽样设计下总体分布函数的通用估计,未研究分位数回归或分布效应,所列领域细分证据不足。
基于排序集样本的非参数最大似然估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
A ranked set sample consists entirely of independently distributed order statistics and can occur naturally in many experimental settings, including problems in reliability. When each ranked set from which an order statistic is drawn is of the same size, and when the statistic of each fixed order is sampled the same number of times, the ranked set sample is said to be balanced. Stokes and Sager have shown that the edf F n of a balanced ranked set sample from the cdf F is an unbiased estimator of F and is more precise than the edf of a simple random sample of the same size. The nonparametric maximum likelihood estimator (MLE) F of F is studied in this article. Its existence and uniqueness is demonstrated, and a general numerical procedure is presented and is shown to converge to F. If the ranked set sample is balanced, it is shown that the EM algorithm, with F n as a seed, converges to the unique solution (F) of the problem's self-consistency equations; the consistency of every iterate of the EM algorithm is also demonstrated. The modifications needed to obtain similar results in unbalanced cases are also discussed. Finally, the results of a simulation study are reported, which support the claim that the nonparametric maximum likelihood estimator, as approximated by an appropriate iterate of the EM algorithm, performs well in the unbalanced case where F n is inapplicable and performs better than F n in balanced cases where both estimators exist and can be compared.