Sciweavers

Share
IDA
2005
Springer

Learning from Ambiguously Labeled Examples

11 years 10 months ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned with ambiguous label classification (ALC), an extension of this setting in which several candidate labels may be assigned to a single example. By extending three concrete classification methods to the ALC setting (nearest neighbor classification, decision tree learning, and rule induction) and evaluating their performance on benchmark data sets, we show that appropriately designed learning algorithms can successfully exploit the information contained in ambiguously labeled examples. Our results indicate that the fundamental idea of the extended methods, namely to disambiguate the label information by means of the inductive bias underlying (heuristic) machine learning methods, works well in practice.
Eyke Hüllermeier, Jürgen Beringer
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where IDA
Authors Eyke Hüllermeier, Jürgen Beringer
Comments (0)
books