Additive Feature Hashing
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Spam detectionSimilar Papers 제목 키워드 기반
Johnson-Lindenstrauss embeddings for noisy vectors -- taking advantage of the noise
This paper investigates theoretical properties of subsampling and hashing as tools for approximate Euclidean norm-preserving embeddings for vectors with (unknown) additive Gaussian noises. Such embeddings are sometimes c…
Dimensionality ReductionLEMMADeep Discrete Supervised Hashing
Hashing has been widely used for large-scale search due to its low storage cost and fast query speed. By using supervised information, supervised hashing can significantly outperform unsupervised hashing. Recently, discr…
Deep HashingImage RetrievalRetrievalFeature Learning based Deep Supervised Hashing with Pairwise Labels
Recent years have witnessed wide application of hashing for large-scale image retrieval. However, most existing hashing methods are based on hand-crafted features which might not be optimally compatible with the hashing …
Deep HashingImage RetrievalRetrievalTripletDeep Supervised Hashing with Triplet Labels
Hashing is one of the most popular and powerful approximate nearest neighbor search techniques for large-scale image retrieval. Most traditional hashing methods first represent images as off-the-shelf visual features and…
Deep HashingImage RetrievalRetrievalTripletRanking Based Locality Sensitive Hashing Enabled Cancelable Biometrics: Index-of-Max Hashing
In this paper, we propose a ranking based locality sensitive hashing inspired two-factor cancelable biometrics, dubbed "Index-of-Max" (IoM) hashing for biometric template protection. With externally generated random para…