Adaptive Group Testing Algorithms to Estimate the Number of Defectives

12/02/2017
by   Nader H. Bshouty, et al.
0

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number of tests in our algorithm is optimal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/02/2020

Optimal Randomized Group Testing Algorithm to Determine the Number of Defectives

We study the problem of determining exactly the number of defective item...
research
04/19/2019

Uncertainty about Uncertainty: Near-Optimal Adaptive Algorithms for Estimating Binary Mixtures of Unknown Coins

Given a mixture between two populations of coins, "positive" coins that ...
research
02/01/2021

Group Testing in the High Dilution Regime

Non-adaptive group testing refers to the problem of inferring a sparse s...
research
08/27/2021

Group Testing with Non-identical Infection Probabilities

We consider a zero-error probabilistic group testing problem where indiv...
research
01/25/2021

On the binary adder channel with complete feedback, with an application to quantitative group testing

We determine the exact value of the optimal symmetric rate point in the ...
research
02/27/2018

Follow Up on Detecting Deficiencies: An Optimal Group Testing Algorithm

In a recent volume of Mathematics Magazine (Vol. 90, No. 3, June 2017) t...
research
10/21/2021

Decision Theoretic Cutoff and ROC Analysis for Bayesian Optimal Group Testing

We study the inference problem in the group testing to identify defectiv...

Please sign up or login with your details

Forgot password? Click here to reset