arrow
Return

Encoding High-Cardinality String Categorical Variables

delete2022-03-01
delete59
delete
OA
AI
P
Patricio Cerda *
G
Gaël Varoquaux
DOI:10.1109/TKDE.2020.2992529delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
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 morphological 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 factorizationon substring counts, and a 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 string entries as they remove the need for feature engineering or data cleaning.
Keywords:
Encoding
Statistical analysis
Cleaning
Semantics
Natural language processing
Data models
Machine learning
Statistical learning
string categorical variables
autoML
interpretable machine learning
large-scale data
min-hash
Gamma-Poisson factorization
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.7K
Citations:
3.2W

Organization

I
Inria
Scholars:
3.4K
Papers: 2.5K
Citations: 343