Research Commons
      • Browse 
        • Communities & Collections
        • Titles
        • Authors
        • By Issue Date
        • Subjects
        • Types
        • Series
      • Help 
        • About
        • Collection Policy
        • OA Mandate Guidelines
        • Guidelines FAQ
        • Contact Us
      • My Account 
        • Sign In
        • Register
      View Item 
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2001 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 2001 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      A simple approach to ordinal classification.

      Frank, Eibe; Hall, Mark A.
      Thumbnail
      Files
      content.pdf
      190.2Kb
      Citation
      Export citation
      Frank, E. & Hall M. (2001). A simple approach to ordinal classification. (Working paper series. University of Waikato, Department of Computer Science. No. 01/5/2001). Hamilton, New Zealand: University of Waikato.
      Permanent Research Commons link: https://hdl.handle.net/10289/64
      Abstract
      Machine learning methods for classification problems commonly assume that the class values are unordered. However, in many practical applications the class values do exhibit a nature order, for example, when learning how to grade. The standard approach to ordinal classification converts the class value into numeric quantity and applies a regression learner to the transformed data, translating the output back into a discrete class value in a post-processing step. A disadvantage of this method is that it can only be applied in conjunction with a regression scheme.

      In this paper we present a simple method that enables standard classification algorithms to make use of ordering information in class attributes. By applying it in conjunction with a decision tree learner we show that it outperforms the naïve approach, which treats the class values as an unordered set. Compared to special-purpose algorithms for ordinal classification our method has the advantage that it can be applied without any modification to the underlying learning scheme.
      Date
      2001-11-01
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      01/5
      Publisher
      University of Waikato, Department of Computer Science
      Collections
      • 2001 Working Papers [5]
      Show full item record  

      Usage

      Downloads, last 12 months
      199
       
       

      Usage Statistics

      For this itemFor all of Research Commons

      The University of Waikato - Te Whare Wānanga o WaikatoFeedback and RequestsCopyright and Legal Statement