ACCELERATING SEARCH IN FUNCTION INDUCTION
| dc.contributor.author | Phan, Thong H. | eng |
| dc.contributor.author | Witten, Ian H | eng |
| dc.date.accessioned | 2008-05-26T20:47:44Z | |
| dc.date.available | 2008-05-26T20:47:44Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1989-11-01 | eng |
| dc.description.abstract | Inducing functions from examples is an important requirement in many learning systems. Blind search is the most general approach, but is vastly less efficient than specialized problem-solving methods. This paper presents a new strategy to accelerate search without sacrificing generality. Experiments with numeric functions show several orders of magnitude performance increase over the standard search technique. Two factors account for this improvement. First, the new strategy manipulates functions in groups instead of singly, so that many can be selected or discarded with only one comparison. Second, functional equivalence is handled automatically by the internal organization of search space. | 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 | 1989-372-34 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31132 | |
| dc.identifier.uri | http://hdl.handle.net/1880/46613 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | ACCELERATING SEARCH IN FUNCTION INDUCTION | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |