By Topic

A classifier based on distance between test samples and average patterns of categorical nearest neighbors

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
$33 $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)
Hotta, S. ; Dept. of Comput. & Inf. Sci., Nagasaki Univ., Japan ; Kiyasu, S. ; Miyahara, S.

The recognition rate of the typical nonparametric method "k-nearest neighbor rule (kNN)" is degraded when the dimensionality of feature vectors is large. Another nonparametric method "linear subspace methods" cannot represent the local distribution of patterns, so recognition rates decrease when pattern distribution is not normal distribution. This paper presents a classifier that outputs the class of a test sample by measuring the distance between the test sample and the average patterns, which are calculated using nearest neighbors belonging to individual categories. A kernel method can be applied to this classifier for improving its recognition rates. The performance of those methods is verified by experiments with handwritten digit patterns and two class artificial ones.

Published in:

Frontiers in Handwriting Recognition, 2004. IWFHR-9 2004. Ninth International Workshop on

Date of Conference:

26-29 Oct. 2004