Instance-based learning algorithms-英文文献.pdfVIP

Machine Learning, 6, 37-66 (1991) © 1991 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands. Instance-Based Learning Algorithms DAVID W. AHA (AHA@ICS.UCI.EDU) DENNIS KIBLER (KIBLER@ICS.UCI.EDU) MARC K. ALBERT (ALBERT@ICS.UCI.EDU) Department of Information and Computer Science, University of California, Irvine, CA 92717 Editor: J.R. Quinlan Abstract. Storing and using specific instances improves the performance of several supervised learning algorithms. These include algorithms that learn decision trees, classification rules, and distributed networks. However, no investigation has analyzed algorithms that use only specific instances to solve incremental learning tasks. In this paper, we describe a framework and methodology, called instance-based learning, that generates classification predictions using only specific instances. Instance-based learning algorithms do not maintain a set of abstractions derived from specific instances. This approach extends the nearest neighbor algorithm, which has large storage requirements. We describe how storage requirements can be significantly reduced with, at most, minor sacrifices in learning rate and classification accuracy. While the storage-reducing algorithm performs well on several real- world databases, its performance degrades rapidly with the level of attribute noise in training instances. Therefore, we extended it with a significance test to distinguish noisy instances. This extended algorithms performance degrades gracefully with increasing noise levels and compar