PRINCIPLED INDUCTION FROM FEATURE VALUES
| dc.contributor.author | Jaliff, Daniel | eng |
| dc.date.accessioned | 2008-05-20T23:30:24Z | |
| dc.date.available | 2008-05-20T23:30:24Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1992-07-01 | eng |
| dc.description.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. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1992-481-19 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31340 | |
| dc.identifier.uri | http://hdl.handle.net/1880/46544 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | PRINCIPLED INDUCTION FROM FEATURE VALUES | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |