Skip to search formSkip to main contentSkip to account menu

Bayes Optimal Multilabel Classification via Probabilistic Classifier Chains

TLDR
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.
View Paper (opens in a new tab)

Combining instance-based learning and logistic regression for multilabel classification

TLDR
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.
View on Springer (opens in a new tab)

Label ranking by learning pairwise preferences

View via Publisher (opens in a new tab)

On label dependence and loss minimization in multi-label classification

TLDR
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.
View on Springer (opens in a new tab)

Decision tree and instance-based learning for label ranking

TLDR
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.
View on ACM (opens in a new tab)

An Exact Algorithm for F-Measure Maximization

TLDR
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.
View Paper (opens in a new tab)

Top-k Selection based on Adaptive Sampling of Noisy Preferences

TLDR
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.
View Paper (opens in a new tab)

Label Ranking Methods based on the Plackett-Luce Model

TLDR
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.
View Paper (opens in a new tab)

On the bayes-optimality of F-measure maximizers

TLDR
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.
View PDF on arXiv (opens in a new tab)

Predicting Partial Orders: Ranking with Abstention

TLDR
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.
View via Publisher (opens in a new tab)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)