Multi-Pass Instance Based Learning
| dc.contributor.author | Steve G Romanuik | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T06:59:31Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T06:59:31Z | |
| dc.date.issued | 1993-03-01T00:00:00Z | en_US |
| dc.description.abstract | This paper introduces a new modified approach to the instance based learning theory. Instance based learning is augmented by neighborhood spheres and multi-pass training to improve both on generalization capabilities and storage requirements. Two models for creating neighborhood spheres are investigated and put in perspective with the IBL instance based learner. The IBL system considered here is based on the proximity algorithm, the growth (additive) algorithm and a noise resistant modification of the growth additive) algorithm. The herein described experiments will address the similarity of the MPIL and the IBL algorithms, but also point out significant differences in the approach of reducing storage requirements and increasing generalization. A time complexity analysis of the proposed multi-pass instance based learning approach is provided. Several domains are used in this study, which include a real world domain in CMOS wafer fault diagnosis to allow for a comparison of these two approaches. Finally, the task of knowledge extraction in form of rules is addressed. | en_US |
| dc.format.extent | 245236 bytes | en_US |
| dc.format.extent | 272596 bytes | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.format.mimetype | application/postscript | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1284 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TRH3/93 | en_US |
| dc.title | Multi-Pass Instance Based Learning | en_US |
| dc.type | Technical Report | en_US |
Files
License bundle
1 - 1 of 1