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á bibliografia

Vydané v:	SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis s. 688 - 696
Hlavní autori:	Iwabuchi, Keita, Steil, Trevor, Priest, Benjamin W., Pearce, Roger, Sanders, Geoffrey
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 17.11.2024
Predmet:	approximate nearest neighbor Approximation algorithms Artificial neural networks Conferences distributed computing Focusing High performance computing Libraries Optimization Random access memory Scalability Vectors
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!