A Fast Algorithm for the Nearest-Neighbor Classifier

@article{Djouadi1997AFA,
  title={A Fast Algorithm for the Nearest-Neighbor Classifier},
  author={Abdelhamid Djouadi and Essaid Bouktache},
  journal={IEEE Trans. Pattern Anal. Mach. Intell.},
  year={1997},
  volume={19},
  pages={277-282}
}
A fast algorithm that finds the nearest neighbor (NN) of an unknown sample from a design set of labeled samples is proposed. This algorithm requires a quite moderate preprocessing effort and a rather excessive storage, but it accomplishes substantial computational savings during classification. The performance of the algorithm is described and compared to the performance of the conventional one. Results on simulated data are provided to illustrate the computational savings that may be achieved… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

A Fast Algorithm for Non Parametric Probability Density Estimation,

C. Vassaire, Pasteur
  • IEEE Trans. Pattern Anal. Machine Intell.,
  • 1982
VIEW 1 EXCERPT

A Branch and Bound Algorithm for Computing KNearest Neighbors

P. M. Narenda
  • IEEE Trans . Syst . , Man , and Cyber .
  • 1981

A Fast Algorithm for Recognizing Nearest Neighbors,

I. K. Sethi
  • IEEE Trans. Syst., Man, and Cyber., vol. 11,
  • 1981
VIEW 1 EXCERPT

An Algorithm for a Selective Nearest Neighbor Decision Rule

Ritter
  • IEEE Trans. Inf. Theory, vol. 21, pp. 665-669, Nov. 1975.
  • 1975

Narenda, ”A Branch and Bound Algorithm for Computing K-Nearest Neighbors,

P.M.K. Fukunaga
  • IEEE Trans. Computers,
  • 1975
VIEW 2 EXCERPTS

Pattern classification and scene analysis

  • A Wiley-Interscience publication
  • 1973
VIEW 1 EXCERPT

Nearest neighbor pattern classification

  • IEEE Trans. Information Theory
  • 1967
VIEW 1 EXCERPT