Show simple item record  

dc.contributor.authorHolmes, Geoffrey
dc.contributor.authorHall, Mark A.
dc.contributor.authorFrank, Eibe
dc.date.accessioned2008-10-17T02:58:59Z
dc.date.available2008-10-17T02:58:59Z
dc.date.issued1999-03
dc.identifier.citationHolmes, 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.en_US
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/1031
dc.description.abstractKnowledge 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.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.relation.ispartofseriesComputer Science Working Papers
dc.subjectcomputer scienceen_US
dc.subjectMachine learning
dc.titleGenerating rule sets from model treesen_US
dc.typeWorking Paperen_US
uow.relation.series99/02


Files in this item

This item appears in the following Collection(s)

Show simple item record