Il libro è attualmente esaurito
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.
Acquisto del libro
A Randomized Approximate Nearest Neighbors Algorithm, Andrei Osipov
- Lingua
- Pubblicato
- 2012
- product-detail.submit-box.info.binding
- (In brossura)
Ti avviseremo via email non appena lo rintracceremo.
Metodi di pagamento
Ancora nessuna valutazione.
- Titolo
- A Randomized Approximate Nearest Neighbors Algorithm
- Sottotitolo
- Theory and Applications
- Lingua
- Inglese
- Autori
- Andrei Osipov
- Pubblicato
- 2012
- Formato
- In brossura
- Pagine
- 136
- ISBN13
- 9783659128387
- Serie
- Descrizione
- 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.