Distributed Sparse Random Projection Trees for Constructing K-Nearest Neighbor Graphs

A random projection tree that partitions data points by projecting them onto random vectors is widely used for approximate nearest neighbor search in high-dimensional space. We consider a particular case of random projection trees for constructing a k-nearest neighbor graph (KNNG) from high-dimensio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium S. 36 - 46
Hauptverfasser:	Ranawaka, Isuru, Rahman, Md Khaledur, Azad, Ariful
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.05.2023
Schlagworte:	Approximation algorithms Costs Data visualization Distributed databases distributed memory algorithms k nearest neighbor graph Nearest neighbor methods parallel algorithm Parallel processing Scalability
ISSN:	1530-2075
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!