On the Estimation of a Convex Set
凸集的估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究均匀分布支持凸集的几何与决策论估计,没有所列计量领域细分的直接证据。
凸集的估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Given independent observations $x_1, \cdots, x_n$ drawn uniformly from an unknown compact convex set $D$ in $\mathbb{R}^p$ ($p$ known) it is desired to estimate $D$ from the observations. This problem was first considered, for $p = 2$, by Ripley and Rasson (1977). We consider a decision-theoretic approach where the loss function is $L(D, \hat{D}) = m(D \Delta \hat{D})$. We prove the completeness of the Bayes estimation rules. A form for the nonrandomized Bayes estimation rules is presented and applied, for an a priori law reflecting ignorance, to the cases $p = 1$ and where $D$ is a rectangle in the plane; some comparisons are made with other estimation methods suggested in the literature. Finally, the consistency of the estimation rules is studied.