scientific article; zbMATH DE number 5957397

MaRDI QIDQ3174038zbMATH OpenFDO

Authors Dana Angluin, Jiang Chen

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v7/angluin06a.html

zbMATH Keywords

samplinghypergraphquery learningchemical reaction networkmultiple round algorithm

Mathematics Subject Classification ID

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

Recommendations

• Learning Theory
• Learning a hidden graph
• Learning a hidden uniform hypergraph
• Learning a Hidden Subgraph
• Automata, Languages and Programming
• Non-adaptive learning of a hidden hypergraph
• Non-adaptive learning of a hidden hypergraph
• Learning Theory
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Error-tolerant non-adaptive learning of a hidden hypergraph

Cited in

(18)

• Reconstructing weighted graphs with minimal query complexity
• Algorithms and Data Structures for Hyperedge Queries
• Learning a hidden uniform hypergraph
• Optimal query complexity bounds for finding graphs
• Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
• Exact learning from an honest teacher that answers membership queries
• Error-tolerant non-adaptive learning of a hidden hypergraph
• Learning Theory
• Learning Theory
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• Learning Boolean halfspaces with small weights from membership queries
• Learning a hidden graph
• Reconstructing Markov processes from independent and anonymous experiments
• Learning a hidden graph using \(O(\log n)\)queries per edge
• Reconstruction of hidden graphs and threshold group testing
• Linear Time Constructions of Some $$d$$-Restriction Problems
• Non-adaptive learning of a hidden hypergraph
• Non-adaptive learning of a hidden hypergraph

This page was built for publication:

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