About: Group testing with nested pools

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Group testing with nested pools Goto Sponge NotDistinct Permalink

An Entity of Type : schema:ScholarlyArticle, within Data Space : covidontheweb.inria.fr associated with source document(s)

Attributes	Values
type	Academic Article research paper schema:ScholarlyArticle
isDefinedBy	Covid-on-the-Web dataset
title	Group testing with nested pools
Creator	Armendáriz, Inés Ferrari, Pablo Fraiman, Daniel Ponce, Silvina
source	ArXiv
abstract	We iterate Dorfman's pool testing algorithm /cite{dorfman} to identify infected individuals in a large population, a classification problem. This is an adaptive scheme with nested pools: pools at a given stage are subsets of the pools at the previous stage. We compute the mean and variance of the number of tests per individual as a function of the pool sizes $m=(m_1,/dots,m_k)$ in the first $k$ stages; in the $(k+1)$-th stage all remaining individuals are tested. Denote by $D_k(m,p)$ the mean number of tests per individual, which we will call the cost of the strategy $m$. The goal is to minimize $D_k(m,p)$ and to find the optimizing values $k$ and $m$. We show that the cost of the strategy $(3^k,/dots,3)$ with $k/approx /log_3(1/p)$ is of order $p/log(1/p)$, and differs from the optimal cost by a fraction of this value. To prove this result we bound the difference between the cost of this strategy with the minimal cost when pool sizes take real values. We conjecture that the optimal strategy, depending on the value of $p$, is indeed of the form $(3^k,/dots,3)$ or of the form $(3^{k-1}4,3^{k-1}/dots,3)$, with a precise description for $k$. This conjecture is supported by inspection of a family of values of $p$. Finally, we observe that for these values of $p$ and the best strategy of the form $(3^k,/dots,3)$, the standard deviation of the number of tests per individual is of the same order as the cost. As an example, when $p=0.02$, the optimal strategy is $k=3$, $m=(27,9,3)$. The cost of this strategy is $0.20$, that is, the mean number of tests required to screen 100 individuals is 20.
has issue date	2020-05-27(xsd:dateTime)
has license	arxiv
sha1sum (hex)	863b6756946d73cccdcedf2c5aed61803caa3b51
resource representing a document's title	Group testing with nested pools
resource representing a document's body	covid:863b6756946d73cccdcedf2c5aed61803caa3b51#body_text
is schema:about of	named entity 'THESE' named entity 'MINIMAL' named entity 'STAGES' named entity 'GIVEN' named entity 'SCHEME' »more»

Faceted Search & Find service v1.13.91 as of Mar 24 2020

Alternative Linked Data Documents: Sponger | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of Jul 10 2020, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (94 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software