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
      • 1999 Working Papers
      • View Item
      •   Research Commons
      • University of Waikato Research
      • Computing and Mathematical Sciences
      • Computer Science Working Paper Series
      • 1999 Working Papers
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Generating rule sets from model trees

      Holmes, Geoffrey; Hall, Mark A.; Frank, Eibe
      Thumbnail
      Files
      uow-cs-wp-1999-02.pdf
      572.9Kb
      Find in your library  
      Citation
      Export citation
      Holmes, G., Hall, M. & Frank, E. (1999). Generating rule sets from model trees. (Working paper 99/02). Hamilton, New Zealand: University of Waikato, Department of Computer Science.
      Permanent Research Commons link: https://hdl.handle.net/10289/1031
      Abstract
      Knowledge discovered in a database must be represented in a form that is easy to understand. Small, easy to interpret nuggets of knowledge from data are one requirement and the ability to induce them from a variety of data sources is a second. The literature is abound with classification algorithms, and in recent years with algorithms for time sequence analysis, but relatively little has been published on extracting meaningful information from problems involving continuous classes (regression).

      Model trees-decision trees with linear models at the leaf nodes-have recently emerged as an accurate method for numeric prediction that produces understandable models. However, it is well known that decision lists-ordered sets of If-Then rules-have the potential to be more compact and therefore more understandable than their tree counterparts.
      Date
      1999-03
      Type
      Working Paper
      Series
      Computer Science Working Papers
      Report No.
      99/02
      Collections
      • 1999 Working Papers [16]
      Show full item record  

      Usage

      Downloads, last 12 months
      110
       
       

      Usage Statistics

      For this itemFor all of Research Commons

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