R. Potharst and J.C. Bioch. Decision trees for ordinal classication. Intelligent Data Analysis, 4(2):97-112, 2000. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
A Simple Approach to Ordinal Classification - Frank, Hall (2001) (2 citations) (Correct)
....strategy for ordinal classi cation that is based on a loss function between pairs of true ranks and predicted ranks. They present a corresponding algorithm similar to a support vector machine, and mention that their approach can be extended to other types of linear classi ers. Potharst and Bioch [6] present a decision tree learning algorithm for monotone learning problems. In a monotone learning problem both the input attributes and the class attribute are assumed to be ordered. This is di erent from the setting considered in this paper because we do not assume that the input is ordered. ....
R. Potharst and J.C. Bioch. Decision trees for ordinal classication. Intelligent Data Analysis, 4(2):97-112, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC