scientific article

zbMath1222.68091MaRDI QIDQ3174038

Jiang Chen, Dana Angluin

Publication date: 12 October 2011

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

samplinghypergraphquery learningchemical reaction networkmultiple round algorithm

Mathematics Subject Classification ID

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

Related Items (15)

Exact learning from an honest teacher that answers membership queries ⋮ Learning Boolean halfspaces with small weights from membership queries ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Unnamed Item ⋮ Reconstructing Markov processes from independent and anonymous experiments ⋮ Non-adaptive learning of a hidden hypergraph ⋮ Learning and Verifying Graphs Using Queries with a Focus on Edge Counting ⋮ Learning a hidden graph using \(O(\log n)\)queries per edge ⋮ Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions ⋮ Learning a hidden graph ⋮ Learning a hidden uniform hypergraph ⋮ Reconstruction of hidden graphs and threshold group testing ⋮ Optimal query complexity bounds for finding graphs ⋮ Reconstructing Weighted Graphs with Minimal Query Complexity ⋮ Non-adaptive Learning of a Hidden Hypergraph

This page was built for publication: