arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2102.03943cs.LG
收藏

加性特征散列

Additive Feature Hashing

M. Andrecut

摘要:

散列技巧是一种机器学习技术,用于将分类特征编码为预定义固定长度的数值向量表示。它的工作原理是使用分类哈希值作为向量索引,并更新这些索引处的向量值。在这里,我们讨论了一种不同的方法,基于加法哈希和高维随机向量的“几乎正交”属性。也就是说,我们证明了可以通过添加哈希值并将其转换为高维数值向量来直接执行添加特征哈希。我们表明,性能的添加剂功能散列是类似的散列技巧,我们说明了数字合成,语言识别和短信垃圾邮件检测数据的结果。

英文摘要:

The hashing trick is a machine learning technique used to encode categorical features into a numerical vector representation of pre-defined fixed length. It works by using the categorical hash values as vector indices, and updating the vector values at those indices. Here we discuss a different approach based on additive-hashing and the "almost orthogonal" property of high-dimensional random vectors. That is, we show that additive feature hashing can be performed directly by adding the hash values and converting them into high-dimensional numerical vectors. We show that the performance of additive feature hashing is similar to the hashing trick, and we illustrate the results numerically using synthetic, language recognition, and SMS spam detection data.

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

↑