DocumentCode :
1083839
Title :
The Nearest Neighbor Classification Rule with a Reject Option
Author :
Hellman, Martin E.
Author_Institution :
Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Mass.
Volume :
6
Issue :
3
fYear :
1970
fDate :
7/1/1970 12:00:00 AM
Firstpage :
179
Lastpage :
185
Abstract :
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.
Keywords :
Costs; Error analysis; Error correction; Nearest neighbor searches; Neural networks; Probability density function; Statistical distributions; Statistics;
fLanguage :
English
Journal_Title :
Systems Science and Cybernetics, IEEE Transactions on
Publisher :
ieee
ISSN :
0536-1567
Type :
jour
DOI :
10.1109/TSSC.1970.300339
Filename :
4082319
Link To Document :
بازگشت