Encoding high-cardinality string categorical variables
arXiv:1907.01860 · doi:10.1109/TKDE.2020.2992529
Abstract
Statistical models usually require vector representations of categorical variables, using for instance one-hot encoding. This strategy breaks down when the number of categories grows, as it creates high-dimensional feature vectors. Additionally, for string entries, one-hot encoding does not capture information in their representation.Here, we seek low-dimensional encoding of high-cardinality string categorical variables. Ideally, these should be: scalable to many categories; interpretable to end users; and facilitate statistical analysis. We introduce two encoding approaches for string categories: a Gamma-Poisson matrix factorization on substring counts, and the min-hash encoder, for fast approximation of string similarities. We show that min-hash turns set inclusions into inequality relations that are easier to learn. Both approaches are scalable and streamable. Experiments on real and simulated data show that these methods improve supervised learning with high-cardinality categorical variables. We recommend the following: if scalability is central, the min-hash encoder is the best option as it does not require any data fit; if interpretability is important, the Gamma-Poisson factorization is the best alternative, as it can be interpreted as one-hot encoding on inferred categories with informative feature names. Both models enable autoML on the original string entries as they remove the need for feature engineering or data cleaning.
References in corpus (2)
Cited by in corpus (9)
- Regularized target encoding outperforms traditional methods in supervised machine learning with high cardinality features
- Automated data processing and feature engineering for deep learning and big data applications: a survey
- FloRa: Flow Table Low-Rate Overflow Reconnaissance and Detection in SDN
- URANUS: Radio Frequency Tracking, Classification and Identification of Unmanned Aircraft Vehicles
- Fairness Implications of Encoding Protected Categorical Attributes
- Predicting delays in Indian lower courts using AutoML and Decision Forests
- Counterfactual Situation Testing: From Single to Multidimensional Discrimination
- From Strings to Data Science: a Practical Framework for Automated String Handling
- Vectorizing string entries for data processing on tables: when are larger language models better?