Sciweavers

Share
132 search results - page 1 / 27
» Learning Monotone Decision Trees in Polynomial Time
Sort
View
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
10 years 2 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
IJCAI
1993
10 years 1 days ago
Learning Decision Lists over Tree Patterns and Its Application
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
Satoshi Kobayashi, Koichi Hori, Setsuo Ohsuga
COLT
2008
Springer
10 years 15 days ago
Learning Random Monotone DNF Under the Uniform Distribution
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...
Linda Sellie
COLT
2003
Springer
10 years 4 months ago
Learning Random Log-Depth Decision Trees under the Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an eļ¬ƒcient algorithm that for each of these models learns all but an ...
Jeffrey C. Jackson, Rocco A. Servedio
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
10 years 22 days ago
Learning Random Monotone DNF
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
Jeffrey C. Jackson, Homin K. Lee, Rocco A. Servedi...
books