arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0510088cs.CG
收藏

局部敏感哈希算法的下界

Lower bounds on Locality Sensitive Hashing

Rajeev Motwani, Assaf Naor, Rina Panigrahy

摘要:

给定度量空间$(X,d_X)$、$c\ge 1$、$r>0$和$p,q\in [0,1]$,映射$\h:X\to \mathbb N$上的分布被称为$(r,cr,p,q)$敏感散列族,如果$X$中距离至多为$r$的任何两个点被$\h$以至少为$p$的概率映射到相同的值,并且距离大于$cr$的任何两个点被$\h$映射到概率至多为$q$的相同值。这个概念是由Indyk和Motwani在1998年引入的,作为一个有效的近似最近邻搜索算法的基础,并已被广泛用于此目的。这些算法的性能由参数$ρ=\frac{\log(1/p)}{\log(1/q)}$决定,并且用小$ρ$构造散列族自动产生改进的最近邻算法。在这里,我们表明,$X=\ell_1$是不可能实现$ρ\le \frac{1}{2c}$。这几乎与实现$ρ\le \frac{1}{c}$的Indyk和Motwani的结构相匹配。

英文摘要:

Given a metric space $(X,d_X)$, $c\ge 1$, $r>0$, and $p,q\in [0,1]$, a distribution over mappings $\h:X\to \mathbb N$ is called a $(r,cr,p,q)$-sensitive hash family if any two points in $X$ at distance at most $r$ are mapped by $\h$ to the same value with probability at least $p$, and any two points at distance greater than $cr$ are mapped by $\h$ to the same value with probability at most $q$. This notion was introduced by Indyk and Motwani in 1998 as the basis for an efficient approximate nearest neighbor search algorithm, and has since been used extensively for this purpose. The performance of these algorithms is governed by the parameter $ρ=\frac{\log(1/p)}{\log(1/q)}$, and constructing hash families with small $ρ$ automatically yields improved nearest neighbor algorithms. Here we show that for $X=\ell_1$ it is impossible to achieve $ρ\le \frac{1}{2c}$. This almost matches the construction of Indyk and Motwani which achieves $ρ\le \frac{1}{c}$.

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

↑