𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper-bound estimates for classifiers based on a dissimilarity function

✍ Scribed by B. P. Rusyn, V. A. Tayanov, O. A. Lutsyka

Book ID
115479399
Publisher
Springer US
Year
2012
Tongue
English
Weight
133 KB
Volume
48
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A fast algorithm for a k-NN classifier b
A fast algorithm for a k-NN classifier based on the branch and bound method and computational quantity estimation
✍ Shin'ichiro Omachi; Hirotomo Aso πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 173 KB πŸ‘ 3 views

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 numb