MinMaxExtension

Package

weka.classifiers.misc

Synopsis

This class is an implementation of the minimal and maximal extension.
All attributes and the class are assumed to be ordinal. The order of the ordinal attributes is determined by the internal codes used by WEKA.

Further information regarding these algorithms can be found in:

S. Lievens, B. De Baets, K. Cao-Van (2006). A Probabilistic Framework for the Design of Instance-Based Supervised Ranking Algorithms in an Ordinal Setting. Annals of Operations Research..

Kim Cao-Van (2003). Supervised ranking: from semantics to algorithms.

Stijn Lievens (2004). Studie en implementatie van instantie-gebaseerde algoritmen voor gesuperviseerd rangschikken.

For more information about supervised ranking, see

http://users.ugent.be/~slievens/supervised_ranking.php

Options

The table below describes the options available for MinMaxExtension.

Option	Description
debug	If set to true, classifier may output additional info to the console.
minMaxExtension	If true, the minimal extension of the algorithm is chosen, otherwise, it is the maximal extension

Capabilities

The table below describes the capabilites of MinMaxExtension.

Capability	Supported
Class	Nominal class, Missing class values, Binary class
Attributes	Binary attributes, Nominal attributes, Unary attributes, Empty nominal attributes
Min # of instances	0