𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Adaptive soft k-nearest-neighbor classifiers

✍ Scribed by Sergio Bermejo; Joan Cabestany

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
92 KB
Volume
32
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Adaptive soft k-nearest-neighbour classi
Adaptive soft k-nearest-neighbour classifiers
✍ Sergio Bermejo; Joan Cabestany πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 124 KB

A novel classi"er is introduced to overcome the limitations of the k-NN classi"cation systems. It estimates the posterior class probabilities using a local Parzen window estimation with the k-nearest-neighbour prototypes (in the Euclidean sense) to the pattern to classify. A learning algorithm is al

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 β€œsoft” K-nearest neighbor voting schem
A β€œsoft” K-nearest neighbor voting scheme
✍ H. B. Mitchell; P. A. Schaefer πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 75 KB

The K-Nearest Neighbor K-NN voting scheme is widely used in problems requiring pattern recognition or classification. In this voting scheme an unknown pattern is classified according to the classifications of its K nearest neighbors. If a majority of the K nearest neighbors have a given classificati