Generating Rule Sets from Model Trees

Model trees--decision trees with linear models at the leaf nodes--have recently emerged as an ax;curate method for numeric prediction that produces understandable models. However, it is 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. We present an algorithm for inducing simple, accurate decision lists from model trees. Model trees are built repeatedly and the best rule is selected at each iteration. This method produces rule sets that are as accurate but smaller than the model tree constructed from the entire dataset. Experimental results for various heuristics which attempt to find a compromise between rule accuracy and rule coverage are reported. We show that our method produces comparably accurate and smaller rule sets than the commercial state-of-the-art rule learning system Cubist.