Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms

With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the term "prototypes" refers to the reference instances used in a nearest neighbor computation -- the instances with respect to which similarity is assessed in order to assign a class to a new data item. Both algorithms rely on stochastic techniquesto search the space of sets of prototypes and are simple to implement. The first is a Monte Carlo sampling algorithm; the second applies random mutation hill climbing. On four datasets we show that only three or four prototypes sufficed to give predictive accuracy equal or superior to a basic nearest neighbor algorithm whose run-time storage costs were approximately 10 to 200 times greater. We briefly investigate how random mutation hill climbing may be applied to select features and prototypes simultaneously. Finally, we explain the performance of the sampling...

• Type: Conference
• Year: 1994
• Where: ICML
• Authors: David B. Skalak
• Keywords: ICML 1994, Machine Learning, Nearest Neighbor, Prototypes, Random Mutation Hill