𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Conjunctions of Unate DNF Formulas: Learning and Structure

✍ Scribed by Aaron Feigelson; Lisa Hellerstein

Book ID
112252324
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
543 KB
Volume
140
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast Learning of k-Term DNF Formulas wit
Fast Learning of k-Term DNF Formulas with Queries
✍ A. Blum; S. Rudich πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 649 KB

This paper presents an algorithm that uses equivalence and membership queries to learn the class of \(k\)-term DNF formulas in time \(n \cdot 2^{o(k)}\), where \(n\) is the number of input variables. This improves upon previous \(O\left(n^{k}\right)\) bounds and allows one to learn DNF formulas of \

Learning of Short Boolean Conjunctions f
Learning of Short Boolean Conjunctions from Negative Examples
✍ Tatsuie Tsukiji; Takashi Tokutani πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract Learning from examples in the presence of overwhelmingly many irrelevant variables has been studied in the field of machine learning theory, where the learner is required to derive as succinct hypotheses as possible. In this paper, we consider the following computational learning proble