Authors
Marko Bohanec, Ivan Bratko
Publication date
1994/6
Journal
Machine Learning
Volume
15
Pages
223-250
Publisher
Kluwer Academic Publishers
Description
When communicating concepts, it is often convenient or even necessary to define a concept approximately. A simple, although only approximately accurate concept definition may be more useful than a completely accurate definition which involves a lot of detail. This paper addresses the problem: given a completely accurate, but complex, definition of a concept, simplify the definition, possibly at the expense of accuracy, so that the simplified definition still corresponds to the concept “sufficiently” well. Concepts are represented by decision trees, and the method of simplification is tree pruning. Given a decision tree that accurately specifies a concept, the problem is to find a smallest pruned tree that still represents the concept within some specified accuracy. A pruning algorithm is presented that finds an optimal solution by generating adense sequence of pruned trees, decreasing in size, such that each tree …
Total citations
1994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024151086771086101231357910169125108167315889
Scholar articles