On Polynomial time Constructions of Minimum Height Decision Tree

Waseem Makhoul, M.Sc. Thesis Seminar
Wednesday, 17.1.2018, 14:30
Taub 601
Prof. Nader Bshouty

We address the problem of constructing a minimum height decision tree of a class C in polynomial time. This problem has many interesting applications that include, to name a few, computer vision, group testing, exact learning from membership queries, and game theory. We further study the combinatorial measure, the extended teaching dimension, ETD(C) of a class C. We show an algorithm that achieves a ETD(C)-approximation of the optimal height. When the extended dimension is small, this approximation is better than the log(|C|)-approximation known from the literature. We also show that there is no better approximation ratio unless P=NP. We then apply our results to learning the class of disjunctions of predicated from membership queries, Bshouty et al. (2017). We show that the extended teaching dimension of this class is bounded from above by the degree d of its Hasse diagram. This gives optimal algorithms when the degree is constant.

Back to the index of events