Rule induction with CN2: some recent improvements
EWSL-91 Proceedings of the European working session on learning on Machine learning
C4.5: programs for machine learning
C4.5: programs for machine learning
Solving the multiple instance problem with axis-parallel rectangles
Artificial Intelligence
Separate-and-Conquer Rule Learning
Artificial Intelligence Review
Semi-supervised support vector machines
Proceedings of the 1998 conference on Advances in neural information processing systems II
The Role of Occam‘s Razor in Knowledge Discovery
Data Mining and Knowledge Discovery
Machine Learning
Decision trees: a recent overview
Artificial Intelligence Review
Hi-index | 0.00 |
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 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.