Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jens Kohlmorgen

dblp:61/3975 · DBLP profile ↗
← Back
11ranked-venue papers
6as first author
0since 2021 · last 2007
—ORCID · none

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

Artificial intelligence and machine learning · 11 · 6 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.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model
0.022001
A Dynamic HMM for On-line Segmentation of Sequential Data · NIPS 2001
Analysis of Drifting Dynamics with Neural Network Hidden Markov Models · NIPS 1997
Machine learning › Probabilistic and Bayesian machine learning
viterbi algorithm
0.012001
A Dynamic HMM for On-line Segmentation of Sequential Data · NIPS 2001

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

hidden markov model · 0.0viterbi algorithm · 0.0sliding window density tracking · 0.0neural network · 0.0
YearPublicationVenuePosition
2007 Hierarchical Feature Extraction for Compact Representation and Classification of Datasets
Markus Schubert, Jens Kohlmorgen
ICONIP (1)2
2002 A Simple Generative Model for Single-Trial EEG Classification
Jens Kohlmorgen, Benjamin Blankertz
ICANN1
2001 A Dynamic HMM for On-line Segmentation of Sequential Data
abstract
We 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
NIPS1
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
ESANN3
1998 Data Set A is a Pattern Matching Problem
Jens Kohlmorgen, Klaus-Robert Müller
Neural Process. Lett.1
1997 Analysis of Wake/Sleep EEG with Competing Experts
Jens Kohlmorgen, Klaus-Robert Müller, Jörn Rittweger, Klaus Pawelzik
ICANN1
1997 Predicting Time Series with Support Vector Machines
Klaus-Robert Müller, Alexander J. Smola, Gunnar Rätsch, Bernhard Schölkopf, Jens Kohlmorgen, Vladimir Vapnik
ICANN5
1997 Analysis of Drifting Dynamics with Neural Network Hidden Markov Models
Jens Kohlmorgen, Klaus-Robert Müller, Klaus Pawelzik
NIPS1
1996 Analysis of Drifting Dynamics with Competing Predictors
Jens Kohlmorgen, Klaus-Robert Müller, Klaus Pawelzik
ICANN1
1996 Prediction of Mixtures
Klaus Pawelzik, Klaus-Robert Müller, Jens Kohlmorgen
ICANN3
1996 Annealed Competition of Experts for a Segmentation and Classification of Switching Dynamics
abstract
We present a method for the unsupervised segmentation of data streams originating from different unknown sources that alternate in time. We use an architecture consisting of competing neural networks. Memory is included to resolve ambiguities of input-output relations. To obtain maximal specialization, the competition is adiabatically increased during training. Our method achieves almost perfect identification and segmentation in the case of switching chaotic dynamics where input manifolds overlap and input-output relations are ambiguous. Only a small dataset is needed for the training procedure. Applications to time series from complex systems demonstrate the potential relevance of our approach for time series analysis and short-term prediction.
Klaus Pawelzik, Jens Kohlmorgen, Klaus-Robert Müller
Neural Comput.2