arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.02640cs.LGcs.CGcs.DSstat.ML
收藏

邻居:谁是他们中最公平的?

Near Neighbor: Who is the Fairest of Them All?

University of Illinois(伊利诺伊大学)

Sariel Har-Peled, Sepideh Mahabadi

摘要:

$\newcommand{\ball}{\mathbb{B}}\newcommand{\dsQ}{\mathcal{Q}}\newcommand{\dsS}{\mathcal{S}}$在这项工作中,我们研究了一个公平的变种的近邻问题。即,给定一组$n$点$P$和参数$r$,目标是预处理这些点,使得给定查询点$q$,查询的$r$邻域中的任何点,即,$\ball(q,r)$,具有被报告为近邻的相同概率。我们表明,基于LSH的算法可以做到公平,而没有显着的效率损失。具体来说,我们展示了一个算法,报告一个点在$r$邻域的查询$q$几乎均匀的概率。查询时间与$O\bigl( \mathrm{dns}(q.r) \dsQ(n,c) \bigr)$成比例,并且其空间是$O(\dsS(n,c))$,其中$\dsQ(n,c)$和$\dsS(n,c)$是用于$c$ -近似近邻的LSH算法的查询时间和空间,并且$\mathrm{dns}(q,r)$是$q$周围的局部密度的函数。我们的方法更普遍地适用于从给定集合的集合的子集合中均匀采样,并且可以在其他一些应用中使用。最后,我们运行的实验,以显示我们的方法对真实数据的性能。

英文摘要:

$\newcommand{\ball}{\mathbb{B}}\newcommand{\dsQ}{\mathcal{Q}}\newcommand{\dsS}{\mathcal{S}}$In this work we study a fair variant of the near neighbor problem. Namely, given a set of $n$ points $P$ and a parameter $r$, the goal is to preprocess the points, such that given a query point $q$, any point in the $r$-neighborhood of the query, i.e., $\ball(q,r)$, have the same probability of being reported as the near neighbor. We show that LSH based algorithms can be made fair, without a significant loss in efficiency. Specifically, we show an algorithm that reports a point in the $r$-neighborhood of a query $q$ with almost uniform probability. The query time is proportional to $O\bigl( \mathrm{dns}(q.r) \dsQ(n,c) \bigr)$, and its space is $O(\dsS(n,c))$, where $\dsQ(n,c)$ and $\dsS(n,c)$ are the query time and space of an LSH algorithm for $c$-approximate near neighbor, and $\mathrm{dns}(q,r)$ is a function of the local density around $q$. Our approach works more generally for sampling uniformly from a sub-collection of sets of a given collection and can be used in a few other applications. Finally, we run experiments to show performance of our approach on real data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑