Back to results
University of Illinois at Urbana-Champaign
On the Learnability of Disjunctive Normal Form Formulas and Decision Trees
Abstract
dc:descriptionThe learnability of disjunctive normal form formulas and decision trees is investigated. Polynomial time algorithms are given, and nonlearnability results are obtained, for restricted versions of these general learning problems.
Degree
thesis:*- Name thesis:degree_name
- Ph.D.
- Level thesis:degree_level
- Dissertation
- Discipline thesis:degree_discipline
- Computer Science
- Grantor
- University of Illinois at Urbana-Champaign
- Year dc:date
- 2014
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Aizenstein, Howard Jay
- Contributors dc:contributor
-
- Pitt, L.,
Subjects
dc:subject × 2Identifiers
dc:identifier.*- Identifier
- (UMI)AAI9328958
- OAI identifier oai:identifier
- oai:www.ideals.illinois.edu:2142/72083