login

Efficient Pruning Methods for Separate-and-Conquer Rule Learning Systems.

Published 1 January 1993
William W. Cohen
Citations82

TL;DR

This paper presents a solution in the form of new pruning techniques that dramatically improve the runtime of rule induction methods with no loss in accuracy: formal analysis shows an improvement in asymp-totic time complexity, and experiments show an order-of-magnitude speedup.

Abstract

Recent years have seen increased interest in systems that learn sets of rules. The goal of this paper is to study the degree to which "separate and conquer" rule learning induction methods scale up to large, real-world learning problems. In particular

Keywords

Computer Science