Doosung Hwang, Daewon Kim, Journal of Information Processing Systems Vol. 13, No. 5, pp. 1345-1357, Oct. 2017  

https://doi.org/10.3745/JIPS.04.0045
Keywords: Class Prototype, Dissimilarity, Greedy Method, Nearest-Neighbor Rule, Set Cover Optimization
Fulltext: PDF

Abstract

A prototype selection method chooses a small set of training points from a whole set of class data. As the data size increases, the selected prototypes play a significant role in covering class regions and learning a discriminate rule. This paper discusses the methods for selecting prototypes in a classification framework. We formulate a prototype selection problem into a set covering optimization problem in which the sets are composed with distance metric and predefined classes. The formulation of our problem makes us draw attention only to prototypes per class, not considering the other class points. A training point becomes a prototype by checking the number of neighbors and whether it is preselected. In this setting, we propose a greedy algorithm which chooses the most relevant points for preserving the class dominant regions. The proposed method is simple to implement, does not have parameters to adapt, and achieves better or comparable results on both artificial and real-world problems.

Statistics
Cite this article