A benchmark of categorical encoders for binary classification

Federico Matteucci, Vadim Arzamasov, Klemens Boehm
7/17/2023
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Categorical encoders transform categorical features into numerical representations that are indispensable for a wide range of machine learning models. Existing encoder benchmark studies lack generalizability because of their limited choice of (1) encoders, (2) experimental factors, and (3) datasets. Additionally, inconsistencies arise from the adoption of varying aggregation strategies. This paper is the most comprehensive benchmark of categorical encoders to date, including an extensive evaluation of 32 configurations of encoders from diverse families, with 36 combinations of experimental factors, and on 50 datasets. The study shows the profound influence of dataset selection, experimental factors, and aggregation strategies on the benchmark's conclusions -- aspects disregarded in previous encoder benchmarks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{matteucci2023benchmark,
  title  = {A benchmark of categorical encoders for binary classification},
  author = {Federico Matteucci and Vadim Arzamasov and Klemens Boehm},
  year   = {2023},
  eprint = {2307.09191},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.09191v3},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.09191.svg)](https://codeofpaper.com/paper/2307.09191)

Discussion