Bookbot

A Randomized Approximate Nearest Neighbors Algorithm

Theory and Applications

Parametry

  • 136 stron
  • 5 godzin czytania

Więcej o książce

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.

Zakup książki

A Randomized Approximate Nearest Neighbors Algorithm, Andrei Osipov

Język
Rok wydania
2012
Oprawa
(miękka)
Jak tylko się pojawi, wyślemy Ci wiadomość e-mail.

Metody płatności

Nikt jeszcze nie ocenił.Oceń

Tytuł
A Randomized Approximate Nearest Neighbors Algorithm
Podtytuł
Theory and Applications
Język
angielski
Rok wydania
2012
Oprawa
miękka
Liczba stron
136
ISBN13
9783659128387
Seria
Tagi
Opis
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.