A Randomized Approximate Nearest Neighbors Algorithm

Theory and Applications

Autori

• Andrei Osipov

Parametri

• 136 pagine
• 5 ore di lettura

• Matematica

Maggiori informazioni sul libro

Focusing on the computational challenges of finding nearest neighbors in high-dimensional spaces, the book introduces a randomized approximate algorithm that significantly reduces the operational costs compared to traditional methods. While the naive approach can be prohibitively time-consuming, especially with large datasets, this new algorithm offers a practical solution for applications in data mining, image processing, and machine learning. The text includes a probabilistic analysis and showcases the algorithm's effectiveness through numerical experiments.

Lingua: Inglese

Pubblicato: 2012

(In brossura)