arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1708.02787cs.LG
收藏

群体测试的非自适应随机算法

Non-Adaptive Randomized Algorithm for Group Testing

Technion(以色列理工学院);Sisters of Nazareth High School(拿撒勒修女高中);Nazareth Baptist High School(拿撒勒浸信会高中)

Nader H. Bshouty, Nuha Diab, Shada R. Kawar, Robert J. Shahla

摘要:

研究了随机关联设计(RID)模型中的非自适应随机算法下的成组检验问题,其中每个检验项都是独立于$\{0,1\}$以固定概率$p$随机选择的.唯一解码的充分和必要的属性是测试的可分性,但不幸的是,没有线性时间算法已知的这样的测试。为了实现线性时间可解码的测试,在文献中的算法使用的析取属性,给出了几乎最佳的测试数量。我们定义了一个新的性质的测试,我们称之为半析取性质。我们发现,有一个线性时间解码这样的测试和$d\to \infty$的测试次数收敛到测试的可分离性的数量,因此是最佳的(在RID模型)。我们的分析表明,在RID模型中,在我们的算法的测试数量是优于一个具有析取性质,即使是小的$d$。

英文摘要:

We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independently from $\{0,1\}$ with a fixed probability $p$. The property that is sufficient and necessary for a unique decoding is the separability of the tests, but unfortunately no linear time algorithm is known for such tests. In order to achieve linear-time decodable tests, the algorithms in the literature use the disjunction property that gives almost optimal number of tests. We define a new property for the tests which we call semi-disjunction property. We show that there is a linear time decoding for such test and for $d\to \infty$ the number of tests converges to the number of tests with the separability property and is therefore optimal (in the RID model). Our analysis shows that, in the RID model, the number of tests in our algorithm is better than the one with the disjunction property even for small $d$.

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

↑