Optimal binning: mathematical programming formulation
From MaRDI portal
Publication:6333312
arXiv2001.08025MaRDI QIDQ6333312FDOQ6333312
Authors: Guillermo Navas-Palencia 
Publication date: 22 January 2020
Abstract: The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a binary, continuous and multi-class target type, incorporating constraints not previously addressed. For all three target types, we introduce a convex mixed-integer programming formulation. Several algorithmic enhancements, such as automatic determination of the most suitable monotonic trend via a Machine-Learning-based classifier and implementation aspects are thoughtfully discussed. The new mathematical programming formulations are carefully implemented in the open-source python library OptBinning.
Has companion code repository: https://github.com/guillermo-navas-palencia/optbinning
This page was built for publication: Optimal binning: mathematical programming formulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6333312)
