Answers are grounded in this paper and cite their sources.
Compression measures used in inductive learners, such as measures based on the minimum description length principle, can be used as a basis for grading candidate hypotheses. Compression ± based induction is suited also for handling noisy data. This paper shows that a simple compression measure can be used to detect noisy training examples, where noise is due to randomclassication errors. A technique is proposed in which noisy examples are detected and eliminated from the training set, and a hypothesis is then built from the set of remaining examples. This noise elimination method was applied to preprocess data for four machine ± learning algorithms, and evaluated on selected medical domains.
No takes yet. Share an insight, caveat, or question.
Gamberger et al. (2000) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: