Probabilistic Active Learning for Active Class Selection

by   Daniel Kottke, et al.
Universität Kassel
Otto-von-Guericke-University Magdeburg

In machine learning, active class selection (ACS) algorithms aim to actively select a class and ask the oracle to provide an instance for that class to optimize a classifier's performance while minimizing the number of requests. In this paper, we propose a new algorithm (PAL-ACS) that transforms the ACS problem into an active learning task by introducing pseudo instances. These are used to estimate the usefulness of an upcoming instance for each class using the performance gain model from probabilistic active learning. Our experimental evaluation (on synthetic and real data) shows the advantages of our algorithm compared to state-of-the-art algorithms. It effectively prefers the sampling of difficult classes and thereby improves the classification performance.


page 1

page 2

page 3

page 4


Limitations of Assessing Active Learning Performance at Runtime

Classification algorithms aim to predict an unknown label (e.g., a quali...

What Can We Expect from Active Class Selection?

The promise of active class selection is that the proportions of classes...

ConfusionFlow: A model-agnostic visualization for temporal analysis of classifier confusion

Classifiers are among the most widely used supervised machine learning a...

Active Learning with Expert Advice

Conventional learning with expert advice methods assumes a learner is al...

Active Decision Boundary Annotation with Deep Generative Models

This paper is on active learning where the goal is to reduce the data an...

Unsupervised Active Learning in Large Domains

Active learning is a powerful approach to analyzing data effectively. We...

Toward Optimal Probabilistic Active Learning Using a Bayesian Approach

Gathering labeled data to train well-performing machine learning models ...

Please sign up or login with your details

Forgot password? Click here to reset