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

The nearest neighbor problem in an abstract metric space

โœ Scribed by Charles D Feustel; Linda G Shapiro

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
246 KB
Volume
1
Category
Article
ISSN
0167-8655

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Tighter Lower Bounds for Nearest Neighbo
Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model
โœ Omer Barkol; Yuval Rabani ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 187 KB

We prove new lower bounds for nearest neighbor search in the Hamming cube. Our lower bounds are for randomized, two-sided error, algorithms in Yao's cell probe model. Our bounds are in the form of a tradeoff among the number of cells, the size of a cell, and the search time. For example, suppose we

A Kullback Leibler-nearest neighbor rule
A Kullback Leibler-nearest neighbor rule classification of EEGs: The EEG population screening problem, an anesthesia level EEG classification application
โœ Will Gersch; F. Martinelli; J. Yonemoto; M.D. Low; J.A. McEwen ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 940 KB

A new methodology, a Kullback Leibler-nearest neighbor (KL-NIV) rule method is introduced for the EEG population screening problem. It is applied to the classification of anesthesia levels of humans in surgery by the analysis of EEGs alone. Stationary epoch multichannel EEGs are considered. In the E