An Improved Inductive Learning Algorithm with a Preanalysis of Data

We propose an improved inductive learning procedure, IPI, to derive classification rules from examples. A preanalysis of data is included which assigns higher weights to those values of the attributes which occur more often in the positive than in the negative examples. The inductive learning problem is represented as a covering problem in integer programming which is solved by a modified greedy algorithm. The results are very encouraging, and are shown for a well-known M3 (Monk's) problem.