Dhagat, A.
Hellerstein, L.
Dept. of Electr. Eng. & Comput. Sci., Wisconsin Univ., Milwaukee, WI;
This paper appears in: Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on
Publication Date: 20-22 Nov 1994
On page(s): 64-74
Meeting Date: 11/20/1994 - 11/22/1994
Location: Santa Fe, NM, USA
ISBN: 0-8186-6580-7
References Cited: 20
INSPEC Accession Number: 4865016
DOI: 10.1109/SFCS.1994.365704
Posted online: 2002-08-06 19:20:36.0
Abstract
We consider the problem of learning in the presence of irrelevant
attributes in Valiant's PAC model (1984). In the PAC model, the goal of
the learner is to produce an approximately correct hypothesis from
random sample data. If the number of relevant attributes in the target
function is small, it may be desirable to produce a hypothesis that also
depends on only a small number of variables. Haussler (1988) previously
considered the problem of learning monomials of a small number of
variables. He showed that the greedy set cover approximation algorithm
can be used as a polynomial-time Occam algorithm for learning monomials
on r of n variables. A outputs a monomial on r(ln q+1) variables, where
q is the number of negative examples in the sample. We extend this
result by showing that there is a polynomial-time Occam algorithm for
learning k-term DNF formulas depending on r of n variables that outputs
a DNF formula depending on O(rklogkq) variables,
where q is the number of negative examples in the sample. We also give a
polynomial-time Occam algorithm for learning decision lists (sometimes
called 1-decision lists) with k alternations
Index Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
