An Empirical Study on Feature Discretization
Not on the map. Why?
Abstract (arXiv)
When dealing with continuous numeric features, we usually adopt feature discretization. In this work, to find the best way to conduct feature discretization, we present some theoretical analysis, in which we focus on analyzing correctness and robustness of feature discretization. Then, we propose a novel discretization method called Local Linear Encoding (LLE). Experiments on two numeric datasets show that, LLE can outperform conventional discretization method with much fewer model parameters.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2; 2023: 1; 2024: 1.
6 papers.
- 2021STAN: Spatio-Temporal Attention Network for Next Location Recommendationcited by 102
- 2022RMT-Net: Reject-aware Multi-Task Network for Modeling Missing-not-at-random Data in Financial Credit Scoringcited by 5
- 2023Multi-Epoch Learning for Deep Click-Through Rate Prediction Modelscited by 3
- 2022Self-supervised Graph-based Point-of-interest Recommendationcited by 2
- 2024Multi-Epoch learning with Data Augmentation for Deep Click-Through Rate Predictioncited by 2
- 2021DNN2LR: Automatic Feature Crossing for Credit Scoringcited by 0
- 2024Multi-Epoch learning with Data Augmentation for Deep Click-Through Rate Prediction27 Jun 2024
- 2023Multi-Epoch Learning for Deep Click-Through Rate Prediction Models31 May 2023
- 2022Self-supervised Graph-based Point-of-interest Recommendation22 Oct 2022
- 2022RMT-Net: Reject-aware Multi-Task Network for Modeling Missing-not-at-random Data in Financial Credit Scoring1 Jun 2022
- 2021DNN2LR: Automatic Feature Crossing for Credit Scoring24 Feb 2021
- 2021STAN: Spatio-Temporal Attention Network for Next Location Recommendation8 Feb 2021