✦ LIBER ✦

Toward Optimal ϵ-Approximate Nearest Neighbor Algorithms

✍ Scribed by Matthew Cary

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 117 KB
Volume: 41
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.2001.1193

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using genetic algorithms to optimize nea

Using genetic algorithms to optimize nearest neighbors for

✍ Hyunchul Ahn; Kyoung-jae Kim 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 418 KB

Fast nearest-neighbor search algorithms

Fast nearest-neighbor search algorithms based on approximation-elimination search

✍ V. Ramasubramanian; Kuldip K. Paliwal 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 272 KB

In this paper, we provide an overview of fast nearest-neighbor search algorithms based on an &approxima-tion}elimination' framework under a class of elimination rules, namely, partial distance elimination, hypercube elimination and absolute-error-inequality elimination derived from approximations of

Optimization of nearest neighbor classif

Optimization of nearest neighbor classifiers via metaheuristic algorithms for credit risk assessment

✍ Yannis Marinakis; Magdalene Marinaki; Michael Doumpos; Nikolaos Matsatsinis; Con 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 175 KB

kNNsim: k-Nearest neighbors similarity w

kNNsim: k-Nearest neighbors similarity with genetic algorithm features optimization enhances the prediction of activity classes for small molecules

✍ Dariusz Plewczynski 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 119 KB