Please use this identifier to cite or link to this item:
Authors: Jaliff, Daniel
Keywords: Computer Science
Issue Date: 1-Jul-1992
Abstract: Principled induction is defined in this thesis as the process of arbitrarily selecting a valid description of a set of examples, and gradually simplifying this description until it is minimal in the preorder defined by the available simplification operators. If the preorder is well chosen, principled induction is a computationally feasible method for inducing descriptions. Algorithms are presented that perform principled induction of decision trees and rules from examples. These algorithms and empirical results obtained using them are shown to support the claim that principled induction is a clear and effective representation of the problem of learning concept descriptions from examples.
Appears in Collections:Technical Reports

Files in This Item:
File Description SizeFormat 
1992-481-19.pdf9.83 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.