3 citations · 3 across the 6 of their papers we have counts for
3 papers · 1 filter
Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing
Nader H. Bshouty, George Haddad, Catherine A. Haddad-Zaknoon
We study the group testing problem with non-adaptive randomized algorithms. Several models have been discussed in the literature to determine how to randomly choose the tests. For…
Adaptive Exact Learning of Decision Trees from Membership Queries
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
In this paper we study the adaptive learnability of decision trees of depth at most from membership queries. This has many applications in automated scientific discovery such a…
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…