Compression measures used in inductive learners, such as measures based on
the minimum description length principle, can be used as a basis for gradin
g candidate hypotheses. Compression-based induction is suited also for hand
ling noisy data. This paper shows that a simple compression measure can be
used to detect noisy training examples, where noise is due to random classi
fication errors. A technique is proposed in which noisy examples are detect
ed and eliminated from the training set, and a hypothesis is then built fro
m the set of remaining examples. This noise elimination method was applied
to preprocess data for four machine-learning algorithms, and evaluated on s
elected medical domains.