Daniel Kottke

Mr. Daniel Kottke

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 November 2021 in Machine Learning
Verified
Journal Article
Open access
PDF file
MPMinh Tuan Pham
Minh Tuan Pham
DKDaniel Kottke
Daniel Kottke
GKGeorg Krempl
Georg Krempl
BSBernhard Sick
Bernhard Sick
Stream-based active learning (AL) strategies minimize the labeling effort by querying labels that improve the classifier’s performance the most. So far, these strategies neglect the fact that an oracle or expert requires time to provide a queried label. We show that existing AL methods deteriorate or even fail under the influence of such verification latency. The problem with these methods is that they estimate a label’s utility on the currently available labeled data. However, when this label would arrive, some of the current data may have gotten outdated and new labels have arrived. In this article, we propose to simulate the available data at the time when the label would arrive. Therefore, our method Forgetting and Simulating (FS) forgets outdated information and simulates the delayed labels to get more realistic utility estimates. We assume to know the label’s arrival date a priori and the classifier’s training data to be bounded by a sliding window. Our extensive experiments show that FS improves stream-based AL strategies in settings with both, constant and variable verification latency.

4 May 2021 in Machine Learning
Verified
Journal Article
Open access
PDF file
DKDaniel Kottke
Daniel Kottke
MHMarek Herde
Marek Herde
CSChristoph Sandrock
Christoph Sandrock
DHDenis Huseljic
Denis Huseljic
GKGeorg Krempl
Georg Krempl
BSBernhard Sick
Bernhard Sick
Gathering labeled data to train well-performing machine learning models is one of the critical challenges in many applications. Active learning aims at reducing the labeling costs by an efficient and effective allocation of costly labeling resources. In this article, we propose a decision-theoretic selection strategy that (1) directly optimizes the gain in misclassification error, and (2) uses a Bayesian approach by introducing a conjugate prior distribution to determine the class posterior to deal with uncertainties. By reformulating existing selection strategies within our proposed model, we can explain which aspects are not covered in current state-of-the-art and why this leads to the superior performance of our approach. Extensive experiments on a large variety of datasets and different kernels validate our claims.

5 March 2021 in Preprints.org
Verified
Preprint
Open access
PDF file
DKDaniel Kottke
Daniel Kottke
MHMarek Herde
Marek Herde
MPMinh Tuan Pham
Minh Tuan Pham
ABAlexander Benz
Alexander Benz
PMPascal Mergard
Pascal Mergard
BSBernhard Sick
Bernhard Sick
Machine learning applications often need large amounts of training data to perform well. Whereas unlabeled data can be easily gathered, the labeling process is difficult, time-consuming, or expensive in most applications. Active learning can help solve this problem by querying labels for those data points that will improve the performance the most. Thereby, the goal is that the learning algorithm performs sufficiently well with fewer labels. We provide a library called scikit-activeml that covers the most relevant query strategies and implements tools to work with partially labeled data. It is programmed in Python and builds on top of scikit-learn.

7 April 2022 in Machine Learning
Verified
Journal Article
Open access
PDF file
AEAdrian Englhardt
Adrian Englhardt
HTHolger Trittenbach
Holger Trittenbach
DKDaniel Kottke
Daniel Kottke
BSBernhard Sick
Bernhard Sick
KBKlemens Böhm
Klemens Böhm
Support Vector Data Description (SVDD) is a popular one-class classifier for anomaly and novelty detection. But despite its effectiveness, SVDD does not scale well with data size. To avoid prohibitive training times, sampling methods select small subsets of the training data on which SVDD trains a decision boundary hopefully equivalent to the one obtained on the full data set. According to the literature, a good sample should therefore contain so-called boundary observations that SVDD would select as support vectors on the full data set. However, non-boundary observations also are essential to not fragment contiguous inlier regions and avoid poor classification accuracy. Other aspects, such as selecting a sufficiently representative sample, are important as well. But existing sampling methods largely overlook them, resulting in poor classification accuracy. In this article, we study how to select a sample considering these points. Our approach is to frame SVDD sampling as an optimization problem, where constraints guarantee that sampling indeed approximates the original decision boundary. We then propose RAPID, an efficient algorithm to solve this optimization problem. RAPID does not require any tuning of parameters, is easy to implement and scales well to large data sets. We evaluate our approach on real-world and synthetic data. Our evaluation is the most comprehensive one for SVDD sampling so far. Our results show that RAPID outperforms its competitors in classification accuracy, in sample size, and in runtime.

9 October 2021
Verified
Book Chapter
Closed access
PDF file
GKGeorg Krempl
Georg Krempl
DKDaniel Kottke
Daniel Kottke
MPMinh Tuan Pham
Minh Tuan Pham

17 March 2023
Verified
Book Chapter
Open access
PDF file
DKDaniel Kottke
Daniel Kottke
CSChristoph Sandrock
Christoph Sandrock
GKGeorg Krempl
Georg Krempl
BSBernhard Sick
Bernhard Sick
In transductive active learning, the goal is to determine the correct labels for an unlabeled, known dataset. Therefore, we can either ask an oracle to provide the right label at some cost or use the prediction of a classifier which we train on the labels acquired so far. In contrast, the commonly used (inductive) active learning aims to select instances for labeling out of the unlabeled set to create a generalized classifier, which will be deployed on unknown data. This article formally defines the transductive setting and shows that it requires new solutions. Additionally, we formalize the theoretically cost-optimal stopping point for the transductive scenario. Building upon the probabilistic active learning framework, we propose a new transductive selection strategy that includes a stopping criterion and show its superiority.