Non-adaptive learning of a hidden hypergraph

DOI10.1016/J.TCS.2017.11.019MaRDI QIDQ1704557zbMATH OpenOpenAlexFDO

Authors Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi

Publication date 12 March 2018

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2017.11.019

zbMATH Keywords

group testinghypergraphsperfect hash familycover-free familynon-adaptive learningmonotone DNF

Mathematics Subject Classification ID

Computational learning theory (68Q32) Hypergraphs (05C65)

Recommendations

• Non-adaptive learning of a hidden hypergraph
• Learning Theory
• scientific article; zbMATH DE number 5957397
• Learning Theory
• Learning a hidden graph

Cites work

• scientific article; zbMATH DE number 5957397 (Why is no real title available?)
• scientific article; zbMATH DE number 1462939 (Why is no real title available?)
• A group testing method for finding patterns in data
• A survey on nonadaptive group testing algorithms through the angle of decoding
• Algorithmic construction of sets for k -restrictions
• Almost optimal cover-free families
• Asking questions to minimize errors
• Construction of \(d(H)\)\,-\,disjunct matrix for group testing in hypergraphs
• Efficient computation of representative sets with applications in parameterized and exact algorithms
• Exact learning from membership queries: some techniques, results and new directions
• Families of finite sets in which no intersection of sets is covered by the union of s others
• Graph-Theoretic Concepts in Computer Science
• Learning a Hidden Matching
• Learning a Hidden Subgraph
• Learning a hidden graph
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Linear Time Constructions of Some $$d$$-Restriction Problems
• Non-adaptive complex group testing with multiple positive sets
• Nonrandom binary superimposed codes
• On Exact Learning Monotone DNF from Membership Queries
• On a bound of cover-free families
• Pooling designs and nonadaptive group testing. Important tools for DNA sequencing.
• Queries and concept learning
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Reconstruction of hidden graphs and threshold group testing
• Sets pooling designs
• Some new bounds for cover-free families
• Testers and their applications
• Trivial two-stage group testing for complexes using almost disjunct matrices.

Cited in

(7)

• Learning a hidden uniform hypergraph
• Optimal query complexity for reconstructing hypergraphs
• Error-tolerant non-adaptive learning of a hidden hypergraph
• Learning Theory
• scientific article; zbMATH DE number 5957397 (Why is no real title available?)
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Non-adaptive learning of a hidden hypergraph

This page was built for publication: Non-adaptive learning of a hidden hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704557)