Holger Trittenbach

Holger Trittenbach

Auto-generated profile, based on publicly available information

Holger Trittenbach

Karlsruhe Institute of Technology, Karlsruhe, Germany

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
12 June 2018
Verified
Conference Paper
Open access
SBSimon Bischof
Simon Bischof
HTHolger Trittenbach
Holger Trittenbach
MVMichael Vollmer
Michael Vollmer
DWDominik Werle
Dominik Werle
Thomas BlankThomas Blank
Thomas Blank
KBKlemens Böhm
Klemens Böhm

14 June 2018 in International Journal of Data Science and Analytics
Verified
Journal Article
Closed access
PDF file
HTHolger Trittenbach
Holger Trittenbach
KBKlemens Böhm
Klemens Böhm

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.

17 August 2022 in SN Computer Science
Verified
Journal Article
Open access
PDF file
JBJakob Bach
Jakob Bach
KZKolja Zoller
Kolja Zoller
HTHolger Trittenbach
Holger Trittenbach
KSKatrin Schulz
Katrin Schulz
KBKlemens Böhm
Klemens Böhm
While feature selection helps to get smaller and more understandable prediction models, most existing feature-selection techniques do not consider domain knowledge. One way to use domain knowledge is via constraints on sets of selected features. However, the impact of constraints, e.g., on the predictive quality of selected features, is currently unclear. This article is an empirical study that evaluates the impact of propositional and arithmetic constraints on filter feature selection. First, we systematically generate constraints from various types, using datasets from different domains. As expected, constraints tend to decrease the predictive quality of feature sets, but this effect is non-linear. So we observe feature sets both adhering to constraints and with high predictive quality. Second, we study a concrete setting in materials science. This part of our study sheds light on how one can analyze scientific hypotheses with the help of constraints.

1 April 2019 in it - Information Technology
Verified
Journal Article
Closed access
PDF file
HTHolger Trittenbach
Holger Trittenbach
JBJakob Bach
Jakob Bach
KBKlemens Böhm
Klemens Böhm
Energy data often is available at high temporal resolution, which challenges the scalability of data-analysis methods. A common way to cope with this is to aggregate data to, say, 15-minute-interval summaries. But it often is not known how much information is lost with this, i. e., how good analysis results on aggregated data actually are. In this article, we study the effects of aggregating energy data on clustering. We propose an experimental design to compare a wide range of clustering methods found in literature. We then introduce different ways to compare clustering results obtained with different aggregation schemes. Our evaluation shows that aggregation affects the clustering quality significantly. Finally, we propose guidelines to select an aggregation scheme.

14 May 2019 in arXiv
Verified
Preprint
Open access
PDF file
HTHolger Trittenbach
Holger Trittenbach
AEAdrian Englhardt
Adrian Englhardt
KBKlemens Böhm
Klemens Böhm
Active learning methods increase classification quality by means of user feedback. An important subcategory is active learning for outlier detection with one-class classifiers. While various methods in this category exist, selecting one for a given application scenario is difficult. This is because existing methods rely on different assumptions, have different objectives, and often are tailored to a specific use case. All this calls for a comprehensive comparison, the topic of this article. This article starts with a categorization of the various methods. We then propose ways to evaluate active learning results. Next, we run extensive experiments to compare existing methods, for a broad variety of scenarios. Based on our results, we formulate guidelines on how to select active learning methods for outlier detection with one-class classifiers.