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.
Optimal binning: mathematical programming formulation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
citation-role summary
background 1
citation-polarity summary
fields
cs.DB 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
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.