The Journal of Machine Learning Research
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Nonadaptive algorithms for threshold group testing
Discrete Applied Mathematics
Optimal query complexity bounds for finding graphs
Artificial Intelligence
Competitive group testing and learning hidden vertex covers with minimum adaptivity
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Reconstructing weighted graphs with minimal query complexity
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Optimally reconstructing weighted graphs using queries
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Toward a deterministic polynomial time algorithm with optimal additive query complexity
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Inferring social networks from outbreaks
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
Journal of Computer and System Sciences
Reconstruction of hidden graphs and threshold group testing
Journal of Combinatorial Optimization
Group testing with multiple mutually-obscuring positives
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices induces an edge. Questions of this type are motivated by problems in molecular biology. In the deterministic nonadaptive setting, we prove nearly matching upper and lower bounds for the minimum possible number of queries required when the family is the family of all stars of a given size or all cliques of a given size. We further describe some bounds that apply to general graphs.