Estimating a Kernel Fisher Discriminant in the Presence of Label Noise


Data noise is present in many machine learning problems domains, some of these are well studied but others have received less attention. In this paper we propose an algorithm for constructing a kernel Fisher discriminant (KFD) from training examples with noisy labels. The approach allows to associate with each example a probability of the label being flipped. We utilise an expectation maximization (EM) algorithm for updating the probabilities. The E-step uses class conditional probabilities estimated as a by-product of the KFD algorithm. The M-step updates the flip probabilities and determines the parameters of the discriminant. We demonstrate the feasibility of the approach on two real-world data-sets.

Extracted Key Phrases

11 Figures and Tables

Citations per Year

151 Citations

Semantic Scholar estimates that this publication has 151 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Lawrence2001EstimatingAK, title={Estimating a Kernel Fisher Discriminant in the Presence of Label Noise}, author={Neil D. Lawrence and Bernhard Sch{\"{o}lkopf}, booktitle={ICML}, year={2001} }