NEO-DNND: Communication-Optimized Distributed Nearest Neighbor Graph Construction

Graph-based approximate nearest neighbor algorithms have shown high neighbor structure representation quality. NN-Descent is a widely known graph-based approximate nearest neighbor (ANN) algorithm. However, graph-based approaches are memory- and time-consuming.To address the drawbacks, we develop a...

Celý popis

Podrobná bibliografie

Vydáno v:	SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis s. 688 - 696
Hlavní autoři:	Iwabuchi, Keita, Steil, Trevor, Priest, Benjamin W., Pearce, Roger, Sanders, Geoffrey
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 17.11.2024
Témata:	approximate nearest neighbor Approximation algorithms Artificial neural networks Conferences distributed computing Focusing High performance computing Libraries Optimization Random access memory Scalability Vectors
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!