• DocumentCode
    2712017
  • Title

    A k-nearest neighbor artificial neural network classifier

  • Author

    Jain, Anil K. ; Mao, Jianchang

  • Author_Institution
    Dept. of Comput. Sci., Michigan State Univ., East Lansing, MI, USA
  • fYear
    1991
  • fDate
    8-14 Jul 1991
  • Firstpage
    515
  • Abstract
    The authors propose an artificial neural network architecture to implement the k-nearest neighbor (k-NN) classifier. This architecture employs a k-maximum network which has some advantages over the `winner-take-all´ type of networks and other techniques used to select the maximum input. This k-maximum network has fewer interconnections than other networks, and is able to select exactly k maximum inputs as long as its (k-1) th and kth maximum inputs are distinct. The classification performance of the k-NN classifier is exactly the same as that of the traditional k-NN classifier. However, the parallelism of the network greatly reduces the computational requirement of the traditional k-NN classifier. Unlike the multilayer perceptrons which involve slowly converging back-propagation algorithms, the k-NN artificial neural network classifier does not need any training algorithm after the initial setting of the weights
  • Keywords
    artificial intelligence; neural nets; pattern recognition; computational requirement; k-maximum network; k-nearest neighbor artificial neural network classifier; parallelism; Artificial neural networks; Cellular neural networks; Computer architecture; Computer networks; Euclidean distance; Impedance matching; Nearest neighbor searches; Neurons; Pattern matching; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    0-7803-0164-1
  • Type

    conf

  • DOI
    10.1109/IJCNN.1991.155387
  • Filename
    155387