13 citations · 20 across the 6 of their papers we have counts for
4 papers · 1 filter
On Learning Graphs with Edge-Detecting Queries
Hasan Abasi, Nader H. Bshouty
We consider the problem of learning a general graph using edge-detecting queries, where the number of vertices is given to the learner. The information theoretic…
Non-Adaptive Learning a Hidden Hipergraph
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
We give a new deterministic algorithm that non-adaptively learns a hidden hypergraph from edge-detecting queries. All previous non-adaptive algorithms either run in exponential tim…
Learning Boolean Halfspaces with Small Weights from Membership Queries
Hasan Abasi, Ali Z. Abdi, Nader H. Bshouty
We consider the problem of proper learning a Boolean Halfspace with integer weights from membership queries only. The best known algorithm for this problem is an…
On Exact Learning Monotone DNF from Membership Queries
Hasan Abasi, Nader H. Bshouty, Hanna Mazzawi
In this paper, we study the problem of learning a monotone DNF with at most terms of size (number of variables in each term) at most ( term -MDNF) from membership que…