On a scalable problem transformation method for multi-label learning

05/27/2019
by   Dora Jambor, et al.
0

Binary relevance is a simple approach to solve multi-label learning problems where an independent binary classifier is built per each label. A common challenge with this in real-world applications is that the label space can be very large, making it difficult to use binary relevance to larger scale problems. In this paper, we propose a scalable alternative to this, via transforming the multi-label problem into a single binary classification. We experiment with a few variations of our method and show that our method achieves higher precision than binary relevance and faster execution times on a top-K recommender system task.

READ FULL TEXT

page 1

page 2

page 3

research
04/13/2020

MLPSVM:A new parallel support vector machine to multi-label learning

Multi-label learning has attracted the attention of the machine learning...
research
04/22/2013

Multi-Label Classifier Chains for Bird Sound

Bird sound data collected with unattended microphones for automatic surv...
research
08/31/2021

Fast Multi-label Learning

Embedding approaches have become one of the most pervasive techniques fo...
research
02/09/2018

ATPboost: Learning Premise Selection in Binary Setting with ATP Feedback

ATPboost is a system for solving sets of large-theory problems by interl...
research
05/31/2022

A Reduction to Binary Approach for Debiasing Multiclass Datasets

We propose a novel reduction-to-binary (R2B) approach that enforces demo...
research
02/03/2014

Transductive Learning with Multi-class Volume Approximation

Given a hypothesis space, the large volume principle by Vladimir Vapnik ...
research
01/13/2015

On Generalizing the C-Bound to the Multiclass and Multi-label Settings

The C-bound, introduced in Lacasse et al., gives a tight upper bound on ...

Please sign up or login with your details

Forgot password? Click here to reset