Estimating a Kernel Fisher Discriminant in the Presence of Label Noise

Abstract

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

Showing 1-10 of 76 extracted citations
02040'04'06'08'10'12'14'16
Citations per Year

236 Citations

Semantic Scholar estimates that this publication has received between 159 and 340 citations based on the available data.

See our FAQ for additional information.