By Topic

The Nearest Neighbor Classification Rule with a Reject Option

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

1 Author(s)
Hellman, M.E. ; Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Mass.

An observation comes from one of two possible classes. If all the statistics of the problem are known, Bayes' classification scheme yields the minimum probability of error. If, instead, the statistics are not known and one is given only a labeled training set, it is known that the nearest neighbor rule has an asymptotic error no greater than twice that of Bayes' rule. Here the (k,k¿) nearest neighbor rule with a reject option is examined. This rule looks at the k nearest neighbors and rejects if less than k¿ of these are from the same class; if k¿ or more are from one class, a decision is made in favor of that class. The error rate of such a rule is bounded in terms of the Bayes' error rate.

Published in:

Systems Science and Cybernetics, IEEE Transactions on  (Volume:6 ,  Issue: 3 )