mlsanityData to 7 Oct 2026

Additive Feature Hashing

arXiv 2102.03943 ↗First posted 7 Feb 2021cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 2 of its 10 references that are in the map. First posted on arXiv 7 Feb 2021.

Builds on

2 of 10 references.

References · 2

  1. 2018The WiLI benchmark dataset for written language identificationcited by 8
  2. 2018High-Dimensional Vector Semanticscited by 1

Built on by

Not cited yet.