arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.03201stat.MEstat.OT
收藏

分层广义成组试验的一种优化设计

An optimal design for hierarchical generalized group testing

Yaakov Malinovsky, Gregory Haber, Paul S. Albert

摘要:

对于那些对资源有限的疾病筛查感兴趣的从业者来说,选择一个最佳的分层组测试策略是一个重要的问题。例如,在大规模人群中筛查传染病时,重要的是使用算法,以最大限度地降低潜在昂贵的检测成本。Black等人(2015)将其描述为一个棘手的问题,除非筛选的个体数量很少。他们提出了一个近似的最佳策略,这是很难实现的大人口规模。在这篇文章中,我们开发了一个最优设计的预期总测试数,可以使用一种新的动态规划算法。我们表明,该算法比Black等人提出的方法更有效。(2015)。此外,我们比较了两种设计的不完美的测试。R代码是为实践者提供的。

英文摘要:

Choosing an optimal strategy for hierarchical group testing is an important problem for practitioners who are interested in disease screening with limited resources. For example, when screening for infectious diseases in large populations, it is important to use algorithms that minimize the cost of potentially expensive assays. Black et al. (2015) described this as an intractable problem unless the number of individuals to screen is small. They proposed an approximation to an optimal strategy that is difficult to implement for large population sizes. In this article, we develop an optimal design with respect to the expected total number of tests that can be obtained using a novel dynamic programming algorithm. We show that this algorithm is substantially more efficient than the approach proposed by Black et al. (2015). In addition, we compare the two designs for imperfect tests. R code is provided for the practitioner.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑