Datasets:
Formats:
csv
Size:
10M - 100M
metadata
annotations_creators: []
license: []
pretty_name: tabular_benchmark
tags: []
task_categories:
- tabular-classification
- tabular-regression
dataset_info:
- config_name: reg_cat
splits:
- reg_cat/*
- config_name: reg_num
splits:
- reg_num/*
- config_name: clf_cat
splits:
- clf_cat/*
- config_name: clf_num
splits:
- clf_num/*
Tabular Benchmark
Dataset Description
This dataset is a curation of various datasets from openML and is curated to benchmark performance of various machine learning algorithms.
- Repository: https://github.com/LeoGrin/tabular-benchmark/community
- Paper: https://hal.archives-ouvertes.fr/hal-03723551v2/document
Dataset Summary
Benchmark made of curation of various tabular data learning tasks, including:
- Regression from Numerical and Categorical Features
- Regression from Numerical Features
- Classification from Numerical and Categorical Features
- Classification from Numerical Features
Supported Tasks and Leaderboards
tabular-regressiontabular-classification
Dataset Structure
Data Splits
This dataset consists of four splits (folders) based on tasks and datasets included in tasks.
- reg_num: Task identifier for regression on numerical features.
- reg_cat: Task identifier for regression on numerical and categorical features.
- clf_num: Task identifier for classification on numerical features.
- clf_cat: Task identifier for classification on categorical features.
Depending on the dataset you want to load, you can load the dataset by passing task_name/dataset_name to data_files argument of load_dataset like below:
from datasets import load_dataset
dataset = load_dataset("inria-soda/tabular-benchmark", data_files="reg_cat/house_sales.csv")
Dataset Creation
Curation Rationale
This dataset is curated to benchmark performance of tree based models against neural networks. The process of picking the datasets for curation is mentioned in the paper as below:
- Heterogeneous columns. Columns should correspond to features of different nature. This excludes images or signal datasets where each column corresponds to the same signal on different sensors.
- Not high dimensional. We only keep datasets with a d/n ratio below 1/10.
- Undocumented datasets We remove datasets where too little information is available. We did keep datasets with hidden column names if it was clear that the features were heterogeneous.
- I.I.D. data. We remove stream-like datasets or time series.
- Real-world data. We remove artificial datasets but keep some simulated datasets. The difference is subtle, but we try to keep simulated datasets if learning these datasets are of practical importance (like the Higgs dataset), and not just a toy example to test specific model capabilities.
- Not too small. We remove datasets with too few features (< 4) and too few samples (< 3 000). For benchmarks on numerical features only, we remove categorical features before checking if enough features and samples are remaining.
- Not too easy. We remove datasets which are too easy. Specifically, we remove a dataset if a simple model (max of a single tree and a regression, logistic or OLS) reaches a score whose relative difference with the score of both a default Resnet (from Gorishniy et al. [2021]) and a default HistGradientBoosting model (from scikit learn) is below 5%. Other benchmarks use different metrics to remove too easy datasets, like removing datasets perfectly separated by a single decision classifier [Bischl et al., 2021], but this ignores varying Bayes rate across datasets. As tree ensembles are superior to simple trees and logistic regresison [Fernández-Delgado et al., 2014], a close score for the simple and powerful models suggests that we are already close to the best achievable score.
- Not deterministic. We remove datasets where the target is a deterministic function of the data. This mostly means removing datasets on games like poker and chess. Indeed, we believe that these datasets are very different from most real-world tabular datasets, and should be studied separately
Source Data
Numerical Classification
Categorical Classification
| dataset_name | n_samples | n_features | original_link | new_link |
|---|---|---|---|---|
| electricity | 38474.0 | 8.0 | https://www.openml.org/d/151 | https://www.openml.org/d/44156 |
| eye_movements | 7608.0 | 23.0 | https://www.openml.org/d/1044 | https://www.openml.org/d/44157 |
| covertype | 423680.0 | 54.0 | https://www.openml.org/d/1596 | https://www.openml.org/d/44159 |
| albert | 58252.0 | 31.0 | https://www.openml.org/d/41147 | https://www.openml.org/d/45035 |
| compas-two-years | 4966.0 | 11.0 | https://www.openml.org/d/42192 | https://www.openml.org/d/45039 |
| default-of-credit-card-clients | 13272.0 | 21.0 | https://www.openml.org/d/42477 | https://www.openml.org/d/45036 |
| road-safety | 111762.0 | 32.0 | https://www.openml.org/d/42803 | https://www.openml.org/d/45038 |
Numerical Regression
Categorical Regression
Dataset Curators
Léo Grinsztajn, Edouard Oyallon, Gaël Varoquaux.
Licensing Information
[More Information Needed]
Citation Information
Léo Grinsztajn, Edouard Oyallon, Gaël Varoquaux. Why do tree-based models still outperform deep learning on typical tabular data?. NeurIPS 2022 Datasets and Benchmarks Track, Nov 2022, New Orleans, United States. ffhal-03723551v2f