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

Full description

Bibliographic Details

Published in:	Proceedings - IEEE International Parallel and Distributed Processing Symposium pp. 36 - 46
Main Authors:	Ranawaka, Isuru, Rahman, Md Khaledur, Azad, Ariful
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.05.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!