El libro está agotado actualmente
Más información sobre el 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.
Compra de libros
A Randomized Approximate Nearest Neighbors Algorithm, Andrei Osipov
- Idioma
- Publicado en
- 2012
- product-detail.submit-box.info.binding
- (Tapa blanda)
Te avisaremos por correo electrónico en cuanto lo localicemos.
Métodos de pago
Nadie lo ha calificado todavía.
- Título
- A Randomized Approximate Nearest Neighbors Algorithm
- Subtítulo
- Theory and Applications
- Idioma
- Inglés
- Autores
- Andrei Osipov
- Editorial
- LAP LAMBERT Academic Publishing
- Publicado en
- 2012
- Formato
- Tapa blanda
- Páginas
- 136
- ISBN13
- 9783659128387
- Serie
- Etiquetas
- No ficción, Ciencia y Matemáticas, Matemáticas
- Descripción
- 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.