Classification with label noise: a Markov chain sampling framework
- Publication Type:
- Journal Article
- Citation:
- Data Mining and Knowledge Discovery, 2019, 33 (5), pp. 1468 - 1504
- Issue Date:
- 2019-09-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Zhao2019_Article_ClassificationWithLabelNoiseAM.pdf | Published Version | 1.33 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2018, The Author(s). The effectiveness of classification methods relies largely on the correctness of instance labels. In real applications, however, the labels of instances are often not highly reliable due to the presence of label noise. Training effective classifiers in the presence of label noise is a challenging task that enjoys many real-world applications. In this paper, we propose a Markov chain sampling (MCS) framework that accurately identifies mislabeled instances and robustly learns effective classifiers. MCS builds a Markov chain where each state uniquely represents a set of randomly sampled instances. We show that the Markov chain has a unique stationary distribution, which puts much larger probability weights on the states dominated by correctly labeled instances than the states dominated by mislabeled instances. We propose a Markov Chain Monte Carlo sampling algorithm to approximate the stationary distribution, which is further used to compute the mislabeling probability for each instance, and train noise-resistant classifiers. The MCS framework is highly compatible with a wide spectrum of classifiers that produce probabilistic classification results. Extensive experiments on both real and synthetic data sets demonstrate the superior effectiveness and efficiency of the proposed MCS framework.
Please use this identifier to cite or link to this item: