English
Related papers

Related papers: A negative binomial approximation in group testing

200 papers

In group testing, the task is to identify defective items by testing groups of them together using as few tests as possible. We consider the setting where each item is defective with a constant probability $\alpha$, independent of all other…

Discrete Mathematics · Computer Science 2024-11-15 Lukas Hintze , Lena Krieg , Olga Scheftelowitsch , Haodong Zhu

The group testing problem consists of determining a small set of defective items from a larger set of items based on a number of possibly-noisy tests, and has numerous practical applications. One of the defining features of group testing is…

Information Theory · Computer Science 2021-11-12 Bernard Teo , Jonathan Scarlett

We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test…

Information Theory · Computer Science 2013-04-25 Chun Lam Chan , Sheng Cai , Mayank Bakshi , Sidharth Jaggi , Venkatesh Saligrama

We consider nonadaptive group testing where each item is placed in a constant number of tests. The tests are chosen uniformly at random with replacement, so the testing matrix has (almost) constant column weights. We show that performance…

Information Theory · Computer Science 2016-08-23 Matthew Aldridge , Oliver Johnson , Jonathan Scarlett

We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease within a population of size n, based on the outcomes of pooled tests which return positive whenever there is at least…

Machine Learning · Statistics 2022-06-16 Amin Coja-Oghlan , Oliver Gebhard , Max Hahn-Klimroth , Alexander S. Wein , Ilias Zadik

In this paper, we study the problem of non-adaptive group testing, in which one seeks to identify which items are defective given a set of suitably-designed tests whose outcomes indicate whether or not at least one defective item was…

Information Theory · Computer Science 2025-09-26 Lan V. Truong , Matthew Aldridge , Jonathan Scarlett

The goal of non-adaptive group testing is to identify at most $d$ defective items from $N$ items, in which a test of a subset of $N$ items is positive if it contains at least one defective item, and negative otherwise. However, in many…

Information Theory · Computer Science 2018-03-19 Thach V. Bui , Tetsuya Kojima , Minoru Kuribayashi , Isao Echizen

The study in group testing aims to develop strategies to identify a small set of defective items among a large population using a few pooled tests. The established techniques have been highly beneficial in a broad spectrum of applications…

Information Theory · Computer Science 2025-01-23 Venkata Gandikota , Nikita Polyanskii , Haodong Yang

In this paper, we introduce a variation of the group testing problem capturing the idea that a positive test requires a combination of multiple ``types'' of item. Specifically, we assume that there are multiple disjoint \emph{semi-defective…

Information Theory · Computer Science 2024-05-10 Thach V. Bui , Jonathan Scarlett

We introduce a novel probabilistic group testing framework, termed Poisson group testing, in which the number of defectives follows a right-truncated Poisson distribution. The Poisson model has a number of new applications, including…

Information Theory · Computer Science 2023-07-19 Amin Emad , Olgica Milenkovic

Group testing is the combinatorial problem of identifying the defective items in a population by grouping items into test pools. Recently, nonadaptive group testing - where all the test pools must be decided on at the start - has been…

Information Theory · Computer Science 2013-01-31 Matthew Aldridge

We introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson matrix factorization (PF) perturbed by a…

Machine Learning · Computer Science 2018-01-08 Olivier Gouvert , Thomas Oberlin , Cédric Févotte

We consider the group testing problem, in the case where the items are defective independently but with non-constant probability. We introduce and analyse an algorithm to solve this problem by grouping items together appropriately. We give…

Information Theory · Computer Science 2015-02-04 Tom Kealy , Oliver Johnson , Robert Piechocki

In the classical combinatorial (adaptive) group testing problem, one is given two integers \(d\) and \(n\), where \(0\le d\le n\), and a population of \(n\) items, exactly \(d\) of which are known to be defective. The question is to devise…

Combinatorics · Mathematics 2014-07-24 David Cariolaro , Zhaiming Shen , Yi Zhang

Group testing is the process of pooling arbitrary subsets from a set of $n$ items so as to identify, with a minimal number of tests, a "small" subset of $d$ defective items. In "classical" non-adaptive group testing, it is known that when…

Information Theory · Computer Science 2018-09-21 Venkata Gandikota , Elena Grigorescu , Sidharth Jaggi , Samson Zhou

Consider a collection of objects, some of which may be `bad', and a test which determines whether or not a given sub-collection contains no bad objects. The non-adaptive pooling (or group testing) problem involves identifying the bad…

Combinatorics · Mathematics 2016-09-06 David J. Balding , David C. Torney

In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number of items in the pool belonging to each category. A prominent…

Information Theory · Computer Science 2025-09-09 Nelvin Tan , Pablo Pascual Cobo , Ramji Venkataramanan

The group testing problem consists of determining a small set of defective items from a larger set of items based on tests on groups of items, and is relevant in applications such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2020-01-27 Steffen Bondorf , Binbin Chen , Jonathan Scarlett , Haifeng Yu , Yuda Zhao

Group testing with inhibitors (GTI) introduced by Farach at al. is studied in this paper. There are three types of items, $d$ defectives, $r$ inhibitors and $n-d-r$ normal items in a population of $n$ items. The presence of any inhibitor in…

Information Theory · Computer Science 2014-12-16 Abhinav Ganesan , Javad Ebrahimi , Sidharth Jaggi , Venkatesh Saligrama

The basic goal in combinatorial group testing is to identify a set of up to $d$ defective items within a large population of size $n \gg d$ using a pooling strategy. Namely, the items can be grouped together in pools, and a single…

Discrete Mathematics · Computer Science 2013-01-21 Mahdi Cheraghchi