Similarities: Nearest-Neighbor Classifiers

  • Miroslav Kubat


Two plants that look very much alike probably represent the same species; likewise, it is quite common that patients complaining of similar symptoms suffer from the same disease. In short, similar objects often belong to the same class—an observation that forms the basis of a popular approach to classification: when asked to determine the class of object x, find the training example most similar to it. Then label x with this example’s class.


  1. 19.
    Cover, T. M. (1968). Estimation by the nearest neighbor rule. IEEE Transactions on Information Theory, IT-14, 50–55.CrossRefzbMATHGoogle Scholar
  2. 20.
    Cover, T. M. & Hart, P. E. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, IT-13, 21–27.CrossRefzbMATHGoogle Scholar
  3. 21.
    Dasarathy, B. V. (1991). Nearest-neighbor classification techniques. Los Alomitos: IEEE Computer Society Press.Google Scholar
  4. 23.
    Dudani, S. A. (1975). The distance-weighted k-nearest-neighbor rule. IEEE Transactions on Systems, Man, and Cybernetics, SMC-6, 325–327.CrossRefGoogle Scholar
  5. 27.
    Fix, E. & Hodges, J. L. (1951). Discriminatory analysis, non-parametric discrimination. USAF School of Aviation Medicine, Randolph Field, TX, Project 21-49-004, Report 4, Contract AF41(128)-3Google Scholar
  6. 35.
    Hart, P. E. (1968). The condensed nearest neighbor rule. IEEE Transactions on Information Theory, IT-14, 515–516.CrossRefGoogle Scholar
  7. 89.
    Tomek, I. (1976). Two modifications of CNN. IEEE Transactions on Systems, Man and Communications, SMC-6, 769–772.MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Miroslav Kubat
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of MiamiCoral GablesUSA

Personalised recommendations