• DocumentCode
    918250
  • Title

    k_n -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 k_n nearest neighbor classification rule is a nonparametric classification procedure that assigns a random vector Z to one of two populations \\pi_1, \\pi_2 . Samples of equal size n are taken from \\pi_1 and \\pi_2 and are ordered separately with respect to their distance from Z = z . The rule assigns Z to \\pi_1 if the distance of the k_n th sample observation from \\pi_1 to z is less than the distance of the k_n th sample observation from \\pi_2 to z ; otherwise Z is assigned to \\pi_2 . 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