By Topic

A new data reduction algorithm for pattern classification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Tahani, H. ; Campus Computing, Missouri Univ., Columbia, MO, USA ; Plummer, B. ; Hemamalini, N.S.

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

Published in:

Acoustics, Speech, and Signal Processing, 1996. ICASSP-96. Conference Proceedings., 1996 IEEE International Conference on  (Volume:6 )

Date of Conference:

7-10 May 1996