Adaptive Prototype Learning Algorithms: Theoretical and Experimental Studies

In this paper, we propose a number of adaptive prototype learning (APL) algorithms. They employ the same algorithmic scheme to determine the number and location of prototypes, but differ in the use of samples or the weighted averages of samples as prototypes, and also in the assumption of distance measures. To understand these algorithms from a theoretical viewpoint, we address their convergence properties, as well as their consistency under certain conditions. We also present a soft version of APL, in which a non-zero training error is allowed in order to enhance the generalization power of the resultant classifier. Applying the proposed algorithms to twelve UCI benchmark data sets, we demonstrate that they outperform many instance-based learning algorithms, the k-nearest neighbor rule, and support vector machines in terms of average test accuracy.

• Type: Journal
• Year: 2006
• Where: JMLR
• Authors: Fu Chang, Chin-Chin Lin, Chi-Jen Lu
• Keywords: Algorithms, JMLR 2006, Non-zero Training Error, UCI Benchmark Data