Approximation quality for sorting rules

Title:	Approximation quality for sorting rules
Authors:	Günther Gediga , Institut für Evaluation und Marktanalysen; Brinkstr. 19; D-49143 Jeggen, Germany Ivo Düntsch , Dept of Computer Science , Brock University , St Catherines, Ontario, L2S 3A1, Canada (Equal authorship implied)
Status:	To appear in Computational Statistics and Data Analysis
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.
Software:	Programm NOO (a scientific prototype for LINUX and MSWIN9x systems)