Robust cutpoints in the logical analysis of numerical data

Techniques for the logical analysis of binary data have successfully been applied to non-binary data which has been ‘binarized’ by means of cutpoints; see Boros et al. (1997, 2000) [7] and [8]. In this paper, we analyze the predictive performance of such techniques and, in particular, we derive generalization error bounds that depend on how ‘robust’ the cutpoints are.