Bjarne C. Hiller

dblp:235/4211 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0005-9371-1702ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 50% Data stream processing · 50%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data stream processing
stream mining
1.012026
Evolving Markov Chains: Online Mode Discovery and Recognition From Data Streams · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Data mining
temporal data mining
1.012026
Evolving Markov Chains: Online Mode Discovery and Recognition From Data Streams · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Medical and health informatics
EEG analysis
0.312026
Evolving Markov Chains: Online Mode Discovery and Recognition From Data Streams · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Ubiquitous computing and smart environments › context recognition
activity recognition
0.312026
Evolving Markov Chains: Online Mode Discovery and Recognition From Data Streams · IEEE Trans. Pattern Anal. Mach. Intell. 2026

Methods — techniques the papers use, named apart from their topics

tensor update · 3.0online learning · 3.0markov chain · 3.0
YearPublicationVenuePosition
2026 Evolving Markov Chains: Online Mode Discovery and Recognition From Data Streams
abstract
Markov chains are simple yet powerful mathematical structures to model temporally dependent processes. They generally assume stationary data, i.e., fixed transition probabilities between observations/states. However, live, real-world processes, like in the context of activity tracking, biological time series, or industrial monitoring, often switch behavior over time. Such behavior switches can be modeled as transitions between higher-level modes (e.g., running, walking, etc.). Yet all modes are usually not previously known, often exhibit vastly differing transition probabilities, and can switch unpredictably. Thus, to track behavior changes of live, real-world processes, this study proposes an online and efficient method to construct Evolving Markov chains (EMCs). EMCs adaptively track transition probabilities, automatically discover modes, and detect mode switches in an online manner. In contrast to previous work, EMCs are of arbitrary order, the proposed update scheme does not rely on tracking windows, only updates the relevant region of the probability tensor, and enjoys geometric convergence of the expected estimates. Our evaluation of synthetic data and real-world applications on human activity recognition, electric motor condition monitoring, and eye-state recognition from electroencephalography (EEG) measurements illustrates the versatility of the approach and points to the potential of EMCs to efficiently track, model, and understand live, real-world processes.
Kutalmis Coskun, Borahan Tümer, Bjarne C. Hiller, Martin Becker 0003
IEEE Trans. Pattern Anal. Mach. Intell.3
2025 SubROC: AUC-Based Discovery of Exceptional Subgroup Performance for Binary Classifiers
abstract
Machine learning (ML) is increasingly employed in real-world applications like medicine or economics, thus, potentially affecting large populations. However, ML models often do not perform homogeneously, leading to underperformance or, conversely, unusually high performance in certain subgroups (e.g., sex=female ∧ marital_status=married). Identifying such subgroups can support practical decisions on which subpopulation a model is safe to deploy or where more training data is required. However, an efficient and coherent framework for effective search is missing. Consequently, we introduce SubROC, an open-source, easy-to-use framework based on Exceptional Model Mining for reliably and efficiently finding strengths and weaknesses of classification models in the form of interpretable population subgroups. SubROC incorporates common evaluation measures (ROC and PR AUC), efficient search space pruning for fast exhaustive subgroup search, control for class imbalance, adjustment for redundant patterns, and significance testing. We illustrate the practical benefits of SubROC in case studies as well as in comparative analyses across multiple datasets.
Tom Siegl, Kutalmis Coskun, Bjarne C. Hiller, Amin Mirzaei, Florian Lemmerich, Martin Becker 0003
ECAI3