Sampling Near Neighbors in Search for Fairness.

Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given a set of points S and a radius parameter r > 0, the r-near neighbor (r-NN) problem asks for a data structure that, given any query point q, returns a point p within distance at most r fr...

Full description

Bibliographic Details

Published in:	Communications of the ACM Vol. 65; no. 8; pp. 83 - 91
Main Authors:	Aumüller, Martin, Har-Peled, Sariel, Mahabadi, Sepideh, Pagh, Rasmus, Silvestri, Francesco
Format:	Article
Published:	Association for Computing Machinery Aug2022
Subjects:	Data Fairness Database searching Search algorithms Algorithms Computer science Computer programming
Online Access:	View this record in EBSCOhost