A Fast Algorithm for a k-NN Classifier Based on the Branch and Bound Method and Computational Quantity Estimation

Shin'ichiro Omachi, Hirotomo Aso

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)

Abstract

The nearest neighbor rule or k-nearest neighbor rule is a technique of nonparametric pattern recognition. Its algorithm is simple and the error is smaller than twice the Bayes error if there are enough training samples. However, it requires an enormous amount of computation, proportional to the number of samples and the number of dimensions of the feature vector. In this paper, a fast algorithm for the k-nearest neighbor rule based on the branch and bound method is proposed. Moreover, a new training algorithm for constructing a search tree that can reduce the computational quantity is proposed. Experimental results show the effectiveness of the proposed algorithms.

Original languageEnglish
Pages (from-to)1-9
Number of pages9
JournalSystems and Computers in Japan
Volume31
Issue number6
DOIs
Publication statusPublished - 2000 Jun

Keywords

  • Branch and bound method
  • Character recognition
  • Nearest neighbor rule
  • Pattern recognition
  • k-nearest neighbor rule

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A Fast Algorithm for a k-NN Classifier Based on the Branch and Bound Method and Computational Quantity Estimation'. Together they form a unique fingerprint.

Cite this