Three discretization methods for rule induction

Jerzy W. Grzymala‐Busse

doi:10.1002/1098-111X(200101)16:1<29::AID-INT4>3.0.CO;2-0

Return

Three discretization methods for rule induction

2000-01-01

Jerzy W. Grzymala‐Busse

Jerzy Stefanowski

DOI：10.1002/1098-111X(200101)16:1<29::AID-INT4>3.0.CO;2-0

Original

Save

View PDF

Abstract

En 中文

We discuss problems associated with induction of decision rules from data with numerical attributes. Real-life data frequently contain numerical attributes. Rule induction from numerical data requires an additional step called discretization. In this step numerical values are converted into intervals. Most existing discretization methods are used before rule induction, as a part of data preprocessing. Some methods discretize numerical attributes while learning decision rules. We compare the classification accuracy of a discretization method based on conditional entropy, applied before rule induction, with two newly proposed methods, incorporated directly into the rule induction algorithm LEM2, where discretization and rule induction are performed at the same time. In all three approaches the same system is used for classification of new, unseen data. As a result, we conclude that an error rate for all three methods does not show significant difference, however, rules induced by the two new methods are simpler and stronger. (C) 2001 John Wiley & Sons, Inc.

Keywords:

ATTRIBUTES

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.