Georg Krempl

dblp:03/8005 · DBLP profile ↗
← Back
9ranked-venue papers in the field
3as first author
4since 2021 · last 2026
0000-0002-4153-2594ORCID · verified

Domains — venue-derived; a paper can count in several

Data Mining & Knowledge Discovery · 9 (3 first)
YearPublicationVenuePosition
2026 The Window Dilemma: Why Concept Drift Detection is Ill-Posed
Brandon Gower-Winter, Misja Groen, Georg Krempl
IDA3
2025 Performative Drift Resistant Classification Using Generative Domain Adversarial Networks
Maciej Makowski, Brandon Gower-Winter, Georg Krempl
IDA3
2022 A Stopping Criterion for Transductive Active Learning
abstract
Abstract 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.
Daniel Kottke, Christoph Sandrock, Georg Krempl, Bernhard Sick
ECML/PKDD (4)3
2021 Active Selection of Classification Features
Thomas T. Kok, Rachel M. Brouwer, René C. W. Mandl, Hugo G. Schnack, Georg Krempl
IDA5
2019 Temporal density extrapolation using a dynamic basis approach
abstract
Density estimation is a versatile technique underlying many data mining tasks and techniques, ranging from exploration and presentation of static data, to probabilistic classification, or identifying changes or irregularities in streaming data. With the pervasiveness of embedded systems and digitisation, this latter type of streaming and evolving data becomes more important. Nevertheless, research in density estimation has so far focused on stationary data, leaving the task of of extrapolating and predicting density at time points outside a training window an open problem. For this task, temporal density extrapolation (TDX) is proposed. This novel method models and predicts gradual monotonous changes in a distribution. It is based on the expansion of basis functions, whose weights are modelled as functions of compositional data over time by using an isometric log-ratio transformation. Extrapolated density estimates are then obtained by extrapolating the weights to the requested time point, and querying the density from the basis functions with back-transformed weights. Our approach aims for broad applicability by neither being restricted to a specific parametric distribution, nor relying on cluster structure in the data. It requires only two additional extrapolation-specific parameters, for which reasonable defaults exist. Experimental evaluation on various data streams, synthetic as well as from the real-world domains of credit scoring and environmental health, shows that the model manages to capture monotonous drift patterns accurately and better than existing methods. Thereby, it requires not more than 1.5 times the run time of a corresponding static density estimation approach.
Georg Krempl, Dominik Lang, Vera Hofer
Data Min. Knowl. Discov.1
2015 Probabilistic Active Learning in Datastreams
Daniel Kottke, Georg Krempl, Myra Spiliopoulou
IDA2
2013 Correcting the Usage of the Hoeffding Inequality in Stream Mining
Pawel Matuszyk, Georg Krempl, Myra Spiliopoulou
IDA2
2011 The Algorithm APT to Classify in Concurrence of Latency and Drift
Georg Krempl
IDA1
2011 Online Clustering of High-Dimensional Trajectories under Concept Drift
Georg Krempl, Zaigham Faraz Siddiqui, Myra Spiliopoulou
ECML/PKDD (2)1