paper-with-me

홈 › Papers

Optimal binning: mathematical programming formulation

2020-01-22 · Guillermo Navas-Palencia

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.

📄 PDF Abstract BibTeX arXiv:2001.08025

Code (1)

guillermo-navas-palencia/optbinning 공식 구현

Tasks

BIG-bench Machine Learning

Similar Papers 제목 키워드 기반

Unbiased Binning for Fairness-aware Attribute Representation

2025-09-26 · Abolfazl Asudeh, Zeinab Asoodeh, Bita Asoodeh, Omid Asudeh arxiv

Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset. It is, however, evident that this step can cause significant bias in data and amplify unfairness in downstre…

Approximately Optimal Binning for the Piecewise Constant Approximation of the Normalized Unexplained Variance (nUV) Dissimilarity Measure

2020-07-24 · Attila Fazekas, György Kovács

The recently introduced Matching by Tone Mapping (MTM) dissimilarity measure enables template matching under smooth non-linear distortions and also has a well-established mathematical background. MTM operates by binning …

Open-Ended Question AnsweringTemplate MatchingTone Mapping

Integer Programming for Learning Directed Acyclic Graphs from Continuous Data

2019-04-23 · Hasan Manzour, Simge Küçükyavuz, Ali Shojaie

Learning directed acyclic graphs (DAGs) from data is a challenging task both in theory and in practice, because the number of possible DAGs scales superexponentially with the number of nodes. In this paper, we study the …

An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs

2014-01-16 · Raghav Aras, Alain Dutech

Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Partially Observable Markov Decision Processes…

On the mathematical consequences of binning spike trains

2016-06-28

We initiate a mathematical analysis of hidden effects induced by binning spike trains of neurons. Assuming that the original spike train has been generated by a discrete Markov process, we show that binning generates a s…