Probabilistic Active Learning for Active Class Selection.
Publication date
2021-08-09
Authors
Kottke, Daniel
Krempl, Georg
Stecklina, Marianne
Rekowski, Cornelius Styp von
Sabsch, Tim
Minh, Tuan Pham
Deliano, Matthias
Spiliopoulou, Myra
Sick, Bernhard
Editors
Advisors
Supervisors
DOI
Document Type
/dk/atira/pure/researchoutput/researchoutputtypes/workingpaper/preprint
Metadata
Show full item recordCollections
License
Abstract
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.
Keywords
Citation
Kottke , D , Krempl , G , Stecklina , M , Rekowski , C S V , Sabsch , T , Minh , T P , Deliano , M , Spiliopoulou , M & Sick , B 2021 ' Probabilistic Active Learning for Active Class Selection. ' arXiv , pp. 1-9 . < https://arxiv.org/abs/2108.03891 >