用于Minhashing的迭代通用Hash函数发生器
Iterative Universal Hash Function Generator for Minhashing
摘要:
Minhashing是一种用于通过利用随机排列中的冲突概率来估计两个集合之间的Jaccard索引的技术。为了加速计算,可以通过使用通用散列函数(诸如由Carter和Wegman提出的$h_{a,b}$函数)来近似随机排列。可以通过使用随机创建的许多哈希函数来更好地估计Jaccard指数。本文提出了一种新的迭代方法来生成一组$h_{a,b}$函数,该方法不需要随机值列表,并且避免了计算过程中的乘法运算。所生成的散列函数的性质仍然是通用散列函数族的性质。这是可能的,因为稀疏数据集上特征出现的随机性。实验结果表明,与传统方法相比,该方法在保持特征散列均匀性的同时,获得了高达$1.38$的速度提升。
英文摘要:
Minhashing is a technique used to estimate the Jaccard Index between two sets by exploiting the probability of collision in a random permutation. In order to speed up the computation, a random permutation can be approximated by using an universal hash function such as the $h_{a,b}$ function proposed by Carter and Wegman. A better estimate of the Jaccard Index can be achieved by using many of these hash functions, created at random. In this paper a new iterative procedure to generate a set of $h_{a,b}$ functions is devised that eliminates the need for a list of random values and avoid the multiplication operation during the calculation. The properties of the generated hash functions remains that of an universal hash function family. This is possible due to the random nature of features occurrence on sparse datasets. Results show that the uniformity of hashing the features is maintaned while obtaining a speed up of up to $1.38$ compared to the traditional approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。