Efficient specific-to-general rule induction
Pedro Domingos · 1996
RISE (Domingos 1995; in press) is a rule induc-tion algorithm that proceeds by gradually gen-eralizing rules, starting with one rule per exam-ple. This has several advantages compared to the more common strategy of gradually specializing initially null rules, and has been shown to lead to significant accuracy gains over algorithms like CGRULES and CN2 in a large number of appli-cation domains. However, RISE’s running time (like that of other rule induction algorithms) is quadratic in the number of examples, making it-.-,...:r..l.L. A-.. ”... _ ̂-^--:..,., ^..., l,..,, sl,+..l.,,,, UIIJulba,“lG I”1 yr”LG;uJurF, “ClJ raqyG UQtJIL”rWG;U. This paper introduces a method for reducing RISE’s running time based on partitioning the training set, evaluating rules from one partition