Improving k-nearest neighbor density and error estimates
✍ Scribed by L.J. Buturović
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 432 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We consider estimation of a multivariate probability density function \(f(x)\) by kernel type nearest neighbor ( \(\mathrm{nn})\) estimators \(g_{n}(x)\). The development of \(\mathrm{nn}\) density estimation theory has had a rich history since Loftsgaarden and Quesenberry proposed the idea in 1965
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