REVIEW 1 cited by
Optimal binning: mathematical programming formulation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 1 Pith paper
-
Explaining Black-Box Clustering Pipelines With Cluster-Explorer
Cluster-Explorer mines concise predicate rules that cover most points in a cluster and spill little into other clusters, and reports better quality and speed than four XAI baselines on 98 clustering results.
Discussion (0). Continue with ORCID to comment.