AAAI
2000
14 years 25 days ago
2000
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
GECCO
2004
Springer
14 years 4 months ago
2004
Springer
In order to handle classification problems with real-valued attributes using discretization algorithms it is necessary to obtain a good and reduced set of cut points in order to l...