• DocumentCode
    1267176
  • Title

    Adaptive nearest neighbor pattern classification

  • Author

    Geva, Shlomo ; Sitte, Joaquin

  • Author_Institution
    Queensland Univ. of Technol., Brisbane, Qld., Australia
  • Volume
    2
  • Issue
    2
  • fYear
    1991
  • fDate
    3/1/1991 12:00:00 AM
  • Firstpage
    318
  • Lastpage
    322
  • Abstract
    A variant of nearest-neighbor (NN) pattern classification and supervised learning by learning vector quantization (LVQ) is described. The decision surface mapping method (DSM) is a fast supervised learning algorithm and is a member of the LVQ family of algorithms. A relatively small number of prototypes are selected from a training set of correctly classified samples. The training set is then used to adapt these prototypes to map the decision surface separating the classes. This algorithm is compared with NN pattern classification, learning vector quantization, and a two-layer perceptron trained by error backpropagation. When the class boundaries are sharply defined (i.e., no classification error in the training set), the DSM algorithm outperforms these methods with respect to error rates, learning rates, and the number of prototypes required to describe class boundaries
  • Keywords
    adaptive systems; artificial intelligence; learning systems; pattern recognition; adaptive systems; artificial intelligence; decision surface mapping; error backpropagation; learning vector quantization; nearest neighbor pattern classification; pattern recognition; perceptron; supervised learning; Backpropagation algorithms; Books; Computer networks; Error analysis; Nearest neighbor searches; Neural networks; Pattern classification; Prototypes; Supervised learning; Vector quantization;
  • fLanguage
    English
  • Journal_Title
    Neural Networks, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1045-9227
  • Type

    jour

  • DOI
    10.1109/72.80344
  • Filename
    80344