Demo Data from VLDB 2026 / reviewers in the wild / expert
Steven Lemm
dblp:55/6281
· DBLP profile ↗
5ranked-venue papers
2as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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.
| Human-computer interaction and pervasive computing
1 paper |
Wearable and physiological sensing · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% | |
| Artificial intelligence
2 papers |
Probabilistic and Bayesian machine learning · 70% Kernel, tree and ensemble methods · 30% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling
classification |
0.1 | 1 | 2006 | Aggregating Classification Accuracy across Time: Application to Single Trial EEG · NIPS 2006 |
Data mining › predictive modeling › classification › incremental classification
online classification |
0.1 | 1 | 2006 | Aggregating Classification Accuracy across Time: Application to Single Trial EEG · NIPS 2006 |
Wearable and physiological sensing
brain-computer interface |
0.1 | 1 | 2006 | Aggregating Classification Accuracy across Time: Application to Single Trial EEG · NIPS 2006 |
Wearable and physiological sensing › electroencephalography
EEG decoding |
0.1 | 1 | 2006 | Aggregating Classification Accuracy across Time: Application to Single Trial EEG · NIPS 2006 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.0 | 1 | 2001 | A Dynamic HMM for On-line Segmentation of Sequential Data · NIPS 2001 |
Machine learning › Probabilistic and Bayesian machine learning
viterbi algorithm |
0.0 | 1 | 2001 | A Dynamic HMM for On-line Segmentation of Sequential Data · NIPS 2001 |
Machine learning › Kernel, tree and ensemble methods › ensemble learning
boosting |
0.0 | 1 | 2000 | Barrier Boosting · COLT 2000 |
Wearable and physiological sensing › electroencephalography
EEG signal processing |
0.0 | 1 | 2006 | Aggregating Classification Accuracy across Time: Application to Single Trial EEG · NIPS 2006 |
Methods — techniques the papers use, named apart from their topics
feature weighting · 0.1bayes error · 0.1viterbi algorithm · 0.0sliding window density tracking · 0.0hidden markov model · 0.0boosting · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | A Generalized Framework for Quantifying the Dynamics of EEG Event-Related DesynchronizationabstractBrains were built by evolution to react swiftly to environmental challenges. Thus, sensory stimuli must be processed ad hoc, i.e., independent--to a large extent--from the momentary brain state incidentally prevailing during stimulus occurrence. Accordingly, computational neuroscience strives to model the robust processing of stimuli in the presence of dynamical cortical states. A pivotal feature of ongoing brain activity is the regional predominance of EEG eigenrhythms, such as the occipital alpha or the pericentral mu rhythm, both peaking spectrally at 10 Hz. Here, we establish a novel generalized concept to measure event-related desynchronization (ERD), which allows one to model neural oscillatory dynamics also in the presence of dynamical cortical states. Specifically, we demonstrate that a somatosensory stimulus causes a stereotypic sequence of first an ERD and then an ensuing amplitude overshoot (event-related synchronization), which at a dynamical cortical state becomes evident only if the natural relaxation dynamics of unperturbed EEG rhythms is utilized as reference dynamics. Moreover, this computational approach also encompasses the more general notion of a "conditional ERD," through which candidate explanatory variables can be scrutinized with regard to their possible impact on a particular oscillatory dynamics under study. Thus, the generalized ERD represents a powerful novel analysis tool for extending our understanding of inter-trial variability of evoked responses and therefore the robust processing of environmental stimuli. Steven Lemm, Klaus-Robert Müller, Gabriel Curio |
PLoS Comput. Biol. | 1 |
| 2006 | Aggregating Classification Accuracy across Time: Application to Single Trial EEGabstractWe present a method for binary on-line classification of triggered but temporally blurred events that are embedded in noisy time series in the context of on-line discrimination between left and right imaginary hand-movement. In particular the goal of the binary classification problem is to obtain the decision, as fast and as reliably as possible from the recorded EEG single trials. To provide a probabilistic decision at every time-point t the presented method gathers information from two distinct sequences of features across time. In order to incorporate decisions from prior time-points we suggest an appropriate weighting scheme, that emphasizes time instances, providing a higher discriminatory power between the instantaneous class distributions of each feature, where the discriminatory power is quantified in terms of the Bayes error of misclassification. The effectiveness of this procedure is verified by its successful application in the 3rd BCI competition. Disclosure of the data after the competition revealed this approach to be superior with single trial error rates as low as 10.7, 11.5 and 16.7% for the three different sub jects under study. Steven Lemm, Christin Schäfer, Gabriel Curio |
NIPS | 1 |
| 2001 | A Dynamic HMM for On-line Segmentation of Sequential DataabstractWe propose a novel method for the analysis of sequential data that exhibits an inherent mode switching. In particular, the data might be a non-stationary time series from a dynamical system that switches between multiple operating modes. Unlike other ap(cid:173) proaches, our method processes the data incrementally and without any training of internal parameters. We use an HMM with a dy(cid:173) namically changing number of states and an on-line variant of the Viterbi algorithm that performs an unsupervised segmentation and classification of the data on-the-fly, i.e. the method is able to pro(cid:173) cess incoming data in real-time. The main idea of the approach is to track and segment changes of the probability density of the data in a sliding window on the incoming data stream. The usefulness of the algorithm is demonstrated by an application to a switching dynamical system. Jens Kohlmorgen, Steven Lemm |
NIPS | 2 |
| 2000 | Barrier Boosting
Gunnar Rätsch, Manfred K. Warmuth, Sebastian Mika, Takashi Onoda, Steven Lemm, Klaus-Robert Müller |
COLT | 5 |
| 1999 | Hidden Markov gating for prediction of change points in switching dynamical systems
Stefan Liehr, Klaus Pawelzik, Jens Kohlmorgen, Steven Lemm, Klaus-Robert Müller |
ESANN | 4 |