Approximation quality for sorting rules [PDF]
Günther Gediga and Ivo Düntsch, May 2002.
Abstract: The paper presents a method for computing an approximation quality for sorting rules of type "nominal -> nominal" (NN), "nominal -> ordinal" (NO), "ordinal -> ordinal" (OO), and its generalisation to "nominal, ordinal -> ordinal" rules (NO-O). We provide a significance test for the overall approximation quality, and a test for partial influence of attributes based on the bootstrap technology. A competing model is also studied. We show that this method is susceptible to local perturbations in the data set, and dissociated from the theory it claims to support.