Graduate Thesis Or Dissertation
 

Constructive induction for improved learning of boolean functions

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/fj2365474

Descriptions

Attribute NameValues
Creator
Abstract
  • Supervised learning programs, such as decision tree learners and neural networks, often must learn Boolean functions. The concept being learned may not easily be expressed in terms of the atomic features given. Constructive induction automatically produces higher level features (combinations of the atomic features), which can improve learning performance. The FLIP algorithm, introduced in this thesis, uses an information gain metric to search for useful conjunctions of atomic features. Given these conjunctions, a decision tree learner is shown to produce trees which are both smaller and more accurate, when learning both random CNF functions and functions from game-playing domains. Furthermore, evidence is provided that FLIP constructs even better features when it has access to training sets for additional functions related to the function being learned.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using ScandAll PRO 1.8.1 on a Fi-6770A in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces

Relationships

Parents:

This work has no parents.

In Collection:

Items

Thumbnail Title Date Uploaded Visibility Actions
file details DrakePeter1996.pdf 2017-08-15 Public Download