127 search results - page 10 / 26 » Learning Monotone Decision Trees in Polynomial Time |
COLT
1993
Springer
14 years 20 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
COLT
2006
Springer
14 years 8 days ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
CAI
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We generalize a learning algorithm originally devised for deterministic all-accepting weighted tree automata (wta) to the setting of arbitrary deterministic wta. The lear...
ADMA
2006
Springer
14 years 9 days ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...