๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A fast algorithm for the nearest-neighbor classifier

โœ Scribed by Djouadi, A.; Bouktache, E.

Book ID
117873333
Publisher
IEEE
Year
1997
Tongue
English
Weight
75 KB
Volume
19
Category
Article
ISSN
0162-8828

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fast implementations of nearest neighbor
Fast implementations of nearest neighbor classifiers
โœ Patrick J. Grother; Gerald T. Candela; James L. Blue ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 641 KB

Standard implementations of non-parametric classifiers have large computational requirements. Parzen classifiers use the distances of an unknown vector to all N prototype samples, and consequently exhibit O(N) behavior in both memory and time. We describe four techniques for expediting the nearest n

A fast nearest neighbor search algorithm
A fast nearest neighbor search algorithm by filtration
โœ Sung-Hyuk Cha; Sargur N. Srihari ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

Classifying an unknown input is a fundamental problem in Pattern Recognition. One standard method is "nding its nearest neighbors in a reference set. It would be very time consuming if computed feature by feature for all templates in the reference set; this namK ve method is O(nd) where n is the num