activity
20102026
most citedOn Learning Graphs with Edge-Detecting Queries

13 citations · 32 across the 25 of their papers we have counts for

collaborators
Showing 2017Show all

6 papers · 1 filter

cs.DS2017

Adaptive Group Testing Algorithms to Estimate the Number of Defectives

Nader H. Bshouty, Vivian E. Bshouty-Hurani, George Haddad +3

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower…

cs.LG2017

Non-Adaptive Randomized Algorithm for Group Testing

Nader H. Bshouty, Nuha Diab, Shada R. Kawar +1

We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independen…

cs.LG2017

The Maximum Cosine Framework for Deriving Perceptron Based Linear Classifiers

Nader H. Bshouty, Catherine A. Haddad-Zaknoon

In this work, we introduce a mathematical framework, called the Maximum Cosine Framework or MCF, for deriving new linear classifiers. The method is based on selecting an appropriat…

cs.LG2017

Exact Learning of Juntas from Membership Queries

Nader H. Bshouty, Areej Costa

In this paper, we study adaptive and non-adaptive exact learning of Juntas from membership queries. We use new techniques to find new bounds, narrow some of the gaps between the lo…

cs.LG2017★ 2 cited

Learning Disjunctions of Predicates

Nader H. Bshouty, Dana Drachsler-Cohen, Martin Vechev +1

Let be a set of boolean functions. We present an algorithm for learning from membership queries. Our algorithm asks at most $…

cs.LG2017

Exact Learning from an Honest Teacher That Answers Membership Queries

Nader H. Bshouty

Given a teacher that holds a function from some class of functions . The teacher can receive from the learner an element~ in the domain (a query) and returns t…