127 search results - page 5 / 26 » Learning Monotone Decision Trees in Polynomial Time |
ICML
1999
IEEE
14 years 9 months ago
1999
IEEE
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
AAAI
2006
13 years 10 months ago
2006
There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
ALT
1995
Springer
14 years 3 days ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
CONCUR
2006
Springer
13 years 10 months ago
2006
Springer
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
FOCS
2009
IEEE
13 years 6 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...