NP-Hard Problems of Learning from Examples

As designing practical algorithms of learning from examples, one has to deal with some optimization problems. The major optimization problems are: the smallest feature subset selection, the smallest decision tree induction, and the smallest k-DNF induction. In this paper, we show that all these optimization problems listed as above are NP-hard, and we present new greedy algorithms for solving these problems.