The design of pattern classifiers such as multiprototype classifiers and neural network classifiers such as learning vector quantization and radial basis function neural networks requires reducing the size of the training data sets. In addition, memory storage, computation complexity and time, and data redundancy demand many pattern classifiers to use a smaller subset of a training data set. In this paper, we present a data reduction algorithm which automatically selects the subset of training data that faithfully represents the training data set for pattern classification. The applicability of this algorithm is demonstrated through k-nearest neighbor and learning vector quantization neural networks classifiers using both speech and synthetic data sets.
['Hossein Tahani', 'Bill Plummer', 'N. S. Hemamalini']
A new data reduction algorithm for pattern classification