Matches in SemOpenAlex for { <https://semopenalex.org/work/W2582049860> ?p ?o ?g. }
- W2582049860 endingPage "2136" @default.
- W2582049860 startingPage "2113" @default.
- W2582049860 abstract "Group-testing refers to the problem of identifying (with high probability) a (small) subset of D defectives from a (large) set of N items via a “small” number of “pooled” tests (i.e., tests that have a positive outcome if at least one of the items being tested in the pool is defective, else have a negative outcome). For ease of presentation in this paper, we focus on the regime when D = O(N <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>1-δ</sup> ) for some δ > 0. The tests may be noiseless or noisy, and the testing procedure may be adaptive (the pool defining a test may depend on the outcome of a previous test), or non-adaptive (each test is performed independent of the outcome of other tests). A rich body of the literature demonstrates that θ(D log(N)) tests are information-theoretically necessary and sufficient for the group-testing problem, and provides algorithms that achieve this performance. However, it is only recently that reconstruction algorithms with computational complexities that are sub-linear in N have started being investigated. In the scenario with adaptive tests with noisy outcomes, we present the first scheme that is simultaneously order-optimal (up to small constant factors) in both the number of tests and the decoding complexity (O (D log(N)) in both the performance metrics). The total number of stages of our adaptive algorithm is “small” (O (log(D))). Similarly, in the scenario with nonadaptive tests with noisy outcomes, we present the first scheme that is simultaneously near-optimal in both the number of tests and the decoding complexity (via an algorithm that requires O (D log(D) log(N)) tests and has a decoding complexity of O(D(log N +log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> D)). Finally, we present an adaptive algorithm that only requires two stages, and for which both the number of tests and the decoding complexity scale as O(D(log N +log <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> D)). For all three settings, the probability of error of our algorithms scales as O (1/(poly(D)). For each of the statements mentioned earlier about the order of the number of measurements, decoding complexity, and probability of error, we provide explicitly computed “small” universal factors in our theorem statements." @default.
- W2582049860 created "2017-02-03" @default.
- W2582049860 creator A5021229539 @default.
- W2582049860 creator A5022799419 @default.
- W2582049860 creator A5055633342 @default.
- W2582049860 creator A5080893953 @default.
- W2582049860 date "2017-04-01" @default.
- W2582049860 modified "2023-09-26" @default.
- W2582049860 title "Efficient Algorithms for Noisy Group Testing" @default.
- W2582049860 cites W1515124366 @default.
- W2582049860 cites W1547622281 @default.
- W2582049860 cites W1965084720 @default.
- W2582049860 cites W1972027649 @default.
- W2582049860 cites W1975680434 @default.
- W2582049860 cites W2017825268 @default.
- W2582049860 cites W2040374776 @default.
- W2582049860 cites W2041682996 @default.
- W2582049860 cites W2054082149 @default.
- W2582049860 cites W2068033507 @default.
- W2582049860 cites W2075614056 @default.
- W2582049860 cites W2087895821 @default.
- W2582049860 cites W2113056523 @default.
- W2582049860 cites W2135024305 @default.
- W2582049860 cites W2135845309 @default.
- W2582049860 cites W2138236884 @default.
- W2582049860 cites W2159456109 @default.
- W2582049860 cites W2167973519 @default.
- W2582049860 cites W2169732368 @default.
- W2582049860 cites W2170496663 @default.
- W2582049860 cites W2303097896 @default.
- W2582049860 cites W2989661724 @default.
- W2582049860 cites W3103169419 @default.
- W2582049860 cites W3106239323 @default.
- W2582049860 cites W4231916799 @default.
- W2582049860 cites W4250519137 @default.
- W2582049860 cites W4293245583 @default.
- W2582049860 cites W53444143 @default.
- W2582049860 cites W57000119 @default.
- W2582049860 doi "https://doi.org/10.1109/tit.2017.2659619" @default.
- W2582049860 hasPublicationYear "2017" @default.
- W2582049860 type Work @default.
- W2582049860 sameAs 2582049860 @default.
- W2582049860 citedByCount "51" @default.
- W2582049860 countsByYear W25820498602017 @default.
- W2582049860 countsByYear W25820498602018 @default.
- W2582049860 countsByYear W25820498602019 @default.
- W2582049860 countsByYear W25820498602020 @default.
- W2582049860 countsByYear W25820498602021 @default.
- W2582049860 countsByYear W25820498602022 @default.
- W2582049860 countsByYear W25820498602023 @default.
- W2582049860 crossrefType "journal-article" @default.
- W2582049860 hasAuthorship W2582049860A5021229539 @default.
- W2582049860 hasAuthorship W2582049860A5022799419 @default.
- W2582049860 hasAuthorship W2582049860A5055633342 @default.
- W2582049860 hasAuthorship W2582049860A5080893953 @default.
- W2582049860 hasConcept C105795698 @default.
- W2582049860 hasConcept C11413529 @default.
- W2582049860 hasConcept C114614502 @default.
- W2582049860 hasConcept C144237770 @default.
- W2582049860 hasConcept C144352353 @default.
- W2582049860 hasConcept C148220186 @default.
- W2582049860 hasConcept C154945302 @default.
- W2582049860 hasConcept C171606756 @default.
- W2582049860 hasConcept C177264268 @default.
- W2582049860 hasConcept C177580056 @default.
- W2582049860 hasConcept C199360897 @default.
- W2582049860 hasConcept C2776502983 @default.
- W2582049860 hasConcept C33923547 @default.
- W2582049860 hasConcept C41008148 @default.
- W2582049860 hasConcept C57273362 @default.
- W2582049860 hasConcept C80444323 @default.
- W2582049860 hasConcept C80478641 @default.
- W2582049860 hasConcept C87007009 @default.
- W2582049860 hasConceptScore W2582049860C105795698 @default.
- W2582049860 hasConceptScore W2582049860C11413529 @default.
- W2582049860 hasConceptScore W2582049860C114614502 @default.
- W2582049860 hasConceptScore W2582049860C144237770 @default.
- W2582049860 hasConceptScore W2582049860C144352353 @default.
- W2582049860 hasConceptScore W2582049860C148220186 @default.
- W2582049860 hasConceptScore W2582049860C154945302 @default.
- W2582049860 hasConceptScore W2582049860C171606756 @default.
- W2582049860 hasConceptScore W2582049860C177264268 @default.
- W2582049860 hasConceptScore W2582049860C177580056 @default.
- W2582049860 hasConceptScore W2582049860C199360897 @default.
- W2582049860 hasConceptScore W2582049860C2776502983 @default.
- W2582049860 hasConceptScore W2582049860C33923547 @default.
- W2582049860 hasConceptScore W2582049860C41008148 @default.
- W2582049860 hasConceptScore W2582049860C57273362 @default.
- W2582049860 hasConceptScore W2582049860C80444323 @default.
- W2582049860 hasConceptScore W2582049860C80478641 @default.
- W2582049860 hasConceptScore W2582049860C87007009 @default.
- W2582049860 hasIssue "4" @default.
- W2582049860 hasLocation W25820498601 @default.
- W2582049860 hasOpenAccess W2582049860 @default.
- W2582049860 hasPrimaryLocation W25820498601 @default.
- W2582049860 hasRelatedWork W1993827876 @default.
- W2582049860 hasRelatedWork W2358034992 @default.
- W2582049860 hasRelatedWork W2582049860 @default.