Le livre est actuellement en rupture de stock
En savoir plus sur le livre
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.
Achat du livre
A Randomized Approximate Nearest Neighbors Algorithm, Andrei Osipov
- Langue
- Année de publication
- 2012
- product-detail.submit-box.info.binding
- (souple)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Personne n'a encore évalué .
- Titre
- A Randomized Approximate Nearest Neighbors Algorithm
- Sous-titre
- Theory and Applications
- Langue
- Anglais
- Auteurs
- Andrei Osipov
- Publié
- 2012
- Format
- souple
- Pages
- 136
- ISBN13
- 9783659128387
- Séries
- Mots clés
- Nonfiction, Science et Mathématiques, Mathématiques
- Description
- 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.