Share This Author
Bayes Optimal Multilabel Classification via Probabilistic Classifier Chains
This paper formalize and analyze MLC within a probabilistic setting, and proposes a new method for MLC that generalizes and outperforms another approach, called classifier chains, that was recently introduced in the literature.
Combining instance-based learning and logistic regression for multilabel classification
This paper proposes a new approach to multilabel classification, which is based on a framework that unifies instance-based learning and logistic regression, comprising both methods as special cases, and allows one to capture interdependencies between labels and to combine model-based and similarity-based inference for multILabel classification.
Label ranking by learning pairwise preferences
On label dependence and loss minimization in multi-label classification
- K. Dembczynski, W. Waegeman, Weiwei Cheng, E. Hüllermeier
- Computer ScienceMachine Learning
- 1 July 2012
It is claimed that two types of label dependence should be distinguished, namely conditional and marginal dependence, and three scenarios in which the exploitation of one of these types of dependence may boost the predictive performance of a classifier are presented.
Decision tree and instance-based learning for label ranking
New methods for label ranking are introduced that complement and improve upon existing approaches and are extensions of two methods that have been used extensively for classification and regression so far, namely instance-based learning and decision tree induction.
An Exact Algorithm for F-Measure Maximization
This paper presents an algorithm which is not only computationally efficient but also exact, regardless of the underlying distribution, and illustrates its practical performance by means of experimental results for multi-label classification.
Top-k Selection based on Adaptive Sampling of Noisy Preferences
- R. Busa-Fekete, Balázs Szörényi, Weiwei Cheng, Paul Weng, E. Hüllermeier
- Computer ScienceICML
- 16 June 2013
This work proposes and formally analyze a general preference-based racing algorithm that is instantiate with three specific ranking procedures and corresponding sampling schemes, and assumes that alternatives can be compared in terms of pairwise preferences.
Label Ranking Methods based on the Plackett-Luce Model
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model, which estimates a global model in which the PL parameters are represented as functions of the instance.
On the bayes-optimality of F-measure maximizers
- W. Waegeman, K. Dembczynski, Arkadiusz Jachnik, Weiwei Cheng, E. Hüllermeier
- Computer ScienceJ. Mach. Learn. Res.
- 17 October 2013
This article provides a formal and experimental analysis of different approaches for maximizing the F-measure, and presents a new algorithm which is not only computationally efficient but also Bayes-optimal, regardless of the underlying distribution.
Predicting Partial Orders: Ranking with Abstention
A general approach to ranking with partial abstention is proposed as well as evaluation metrics for measuring the correctness and completeness of predictions, able to achieve a reasonable trade-off between these two criteria.