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...

Full description

Bibliographic Details

Published in:	SC24-W: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis pp. 688 - 696
Main Authors:	Iwabuchi, Keita, Steil, Trevor, Priest, Benjamin W., Pearce, Roger, Sanders, Geoffrey
Format:	Conference Proceeding
Language:	English
Published:	IEEE 17.11.2024
Subjects:	approximate nearest neighbor Approximation algorithms Artificial neural networks Conferences distributed computing Focusing High performance computing Libraries Optimization Random access memory Scalability Vectors
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!