Title:

Program NOO. Measuring the approximation quality for sorting rules

Authors:

Ivo Düntsch , Dept of Computer Science , Brock University , St Catherines, Ontario, L2S 3A1, Canada

Günther Gediga , Institut für Evaluation und Marktanalysen; Brinkstr. 19; D-49143 Jeggen; Germany

Status:

Technical Report; Version 1.10; 08/2000

Abstract:

The paper presents a description of the program NOO, which can be used for computing an approximation quality for sorting rules of the types ``nominal to nominal'' (NN),``nominal to ordinal'' (NO), ``ordinal to ordinal'' (OO),and its generalisation to ``(nominal, ordinal) ordinal'' rules (NOO). 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 - the approach of Greco et al. (1998) - will be also computed.

Download:

Program description PDF file (60 KB)

Download:

LINUX executable (35 KB)

Download:

MS-Win9x executable (80KB)

Link:

The paper