A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Monotone Relabeling in Ordinal Classification
2010
2010 IEEE International Conference on Data Mining
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attributes are called monotone. In this paper we present a new algorithm to compute an optimal monotone classification of a data set for convex loss functions. Moreover, we show how the algorithm can be extended to compute all optimal monotone classifications with little additional effort. Monotone relabeling is useful for
doi:10.1109/icdm.2010.92
dblp:conf/icdm/Feelders10
fatcat:wo2yhsjeyrar7c6rlqphiibcga