Journal
MACHINE LEARNING
Volume 45, Issue 2, Pages 123-145Publisher
KLUWER ACADEMIC PUBL
DOI: 10.1023/A:1010950718922
Keywords
PAC-learning; maximum entropy; learning algorithms
Categories
Ask authors/readers for more resources
We are interested in distributions which are derived as a maximum entropy distribution from a given set of constraints. More specifically, we are interested in the case where the constraints are the expectation of individual and pairs of attributes. For such a given maximum entropy distribution (with some technical restrictions) we develop an efficient learning algorithm for read-once DNF. We extend our results to monotone read-k DNF following the techniques of (Hancock & Mansour, 1991).
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available