Generalized Group Testing Procedures
广义组检验程序AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用统计决策中的层级组检验,组结构不构成面板、网络干扰或金融风险的直接证据。
反馈分类问题广义组检验程序AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
A person wishes to determine which, if any, of $n = \Pi^k_{j=1} a_j$ i.i.d. random variables, $X(i_1,\cdots, i_k), i_j = 1,\cdots, a_j$, lie in some specified set $A$. Such observations will be called unsafe. It is assumed that the density of the $X$'s is known and that $Y_j(i_1,\cdots, i_j)$, the sum of all the $X$'s whose first $j$ indices are $i_1,\cdots, i_j$, can be measured as easily as the individual $X$'s. In this paper, search procedures of the following form are studied. The person first measures $Y_0$, the sum of all the $X$'s. On the basis of $Y_0$, he decides whether to stop, and classify all the $X$'s as safe, or to continue and measure $Y_1(1),\cdots, Y_1(a_1 - 1)$ (and hence know $Y_1(a_1) = Y_0 - \sum^{a_1-1}_{i=1} Y_1(i))$. If he has decided to continue, he measures $Y_1(j)$. For each of $(Y_0, Y_1(j))$, he must decide whether to stop and classify as safe all $X$'s whose first index is $j$, or to continue and measure $Y_2(j, 1),\cdots, Y_2(j, a_2 - 1)$ (and hence know $Y_2(j, a_2))$. He continues in this fashion until each $X$ has either been classified safe or has been observed. Unlike most group testing problems, he is not restricted to procedures that will locate all the unsafe observations. Instead there is a loss function $L(x)$ measuring the loss if $X(i_1,\cdots, i_k) = x$ and is not observed. Let $V_1$ be the expected loss of a procedure (summed over all the $X$'s), and let $V_2$ be the expected number of measurements. For each $0 \leqq p \leqq 1$, a class of rules $D(p)$ is defined such that if a procedure is in $D(p)$, it minimizes $pV_1 + (1 - p)V_2$, and conversely, if a procedure minimizes $pV_1 + (1 - p)V_2$, then there is a rule in $D(p)$ that leads to the same decisions a.e. The union of the $D(p)$ is shown to be an essentially complete class of rules. A simpler form for the rules in $D(p)$ is derived for the case where the loss function is nondecreasing. More specific calculations are given for the case where the $X$'s are normally distributed, and $L(x)$ is the indicator function for the set $\{x \geqq d\}$.