DocumentCode
918250
Title
-nearest neighbor classification
Author
Goldstein, Matthew
Volume
18
Issue
5
fYear
1972
fDate
9/1/1972 12:00:00 AM
Firstpage
627
Lastpage
630
Abstract
The
nearest neighbor classification rule is a nonparametric classification procedure that assigns a random vector
to one of two populations
. Samples of equal size
are taken from
and
and are ordered separately with respect to their distance from
. The rule assigns
to
if the distance of the
th sample observation from
to
is less than the distance of the
th sample observation from
to
; otherwise
is assigned to
. This rule is equivalent to the Fix and Hodges, "majority rule" [4] or the nearest neighbor rule of Cover and Hart [3]. This paper studies some asymptotic properties of this rule including an expression for a consistent upper bound on the probability of misclassification.
nearest neighbor classification rule is a nonparametric classification procedure that assigns a random vector
to one of two populations
. Samples of equal size
are taken from
and
and are ordered separately with respect to their distance from
. The rule assigns
to
if the distance of the
th sample observation from
to
is less than the distance of the
th sample observation from
to
; otherwise
is assigned to
. This rule is equivalent to the Fix and Hodges, "majority rule" [4] or the nearest neighbor rule of Cover and Hart [3]. This paper studies some asymptotic properties of this rule including an expression for a consistent upper bound on the probability of misclassification.Keywords
Pattern classification; Distribution functions; Euclidean distance; Mathematics; Neural networks; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1972.1054888
Filename
1054888
Link To Document