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

Georg Dorffner

dblp:81/6229 · DBLP profile ↗
← Back
31ranked-venue papers
6as first author
2since 2021 · last 2022
0000-0002-3181-2576ORCID · verified

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

Artificial intelligence and machine learning · 24 · 4 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 6 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorSystems, architecture and hardware · 1

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
3 papers
Probabilistic and Bayesian machine learning · 64% Language models and text generation · 36%
Theoretical computer science
2 papers
Automata and formal languages · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation › natural language understanding
grammaticality judgment
0.011999
Graded Grammaticality in Prediction Fractal Machines · NIPS 1999
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference
0.011997
Experiences with Bayesian Learning in a Real World Application · NIPS 1997

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

prediction fractal machines · 0.0fractal representations · 0.0bayesian learning · 0.0
YearPublicationVenuePosition
2022 Relational local electroencephalography representations for sleep scoring
abstract
Computational sleep scoring from multimodal neurophysiological time-series (polysomnography PSG) has achieved impressive clinical success. Models that use only a single electroencephalographic (EEG) channel from PSG have not yet received the same clinical recognition, since they lack Rapid Eye Movement (REM) scoring quality. The question whether this lack can be remedied at all remains an important one. We conjecture that predominant Long Short-Term Memory (LSTM) models do not adequately represent distant REM EEG segments (termed epochs), since LSTMs compress these to a fixed-size vector from separate past and future sequences. To this end, we introduce the EEG representation model ENGELBERT (electroEncephaloGraphic Epoch Local Bidirectional Encoder Representations from Transformer). It jointly attends to multiple EEG epochs from both past and future. Compared to typical token sequences in language, for which attention models have originally been conceived, overnight EEG sequences easily span more than 1000 30 s epochs. Local attention on overlapping windows reduces the critical quadratic computational complexity to linear, enabling versatile sub-one-hour to all-day scoring. ENGELBERT is at least one order of magnitude smaller than established LSTM models and is easy to train from scratch in a single phase. It surpassed state-of-the-art macro F1-scores in 3 single-EEG sleep scoring experiments. REM F1-scores were pushed to at least 86%. ENGELBERT virtually closed the gap to PSG-based methods from 4-5 percentage points (pp) to less than 1 pp F1-score.
Georg Brandmayr, Manfred Martin Hartmann, Franz Fürbass, Gerald Matz, Matthias Samwald, Tilmann Kluge, Georg Dorffner
Neural Networks7
2021 Self-Attention Long-Term Dependency Modelling in Electroencephalography Sleep Stage Prediction
Georg Brandmayr, Manfred Martin Hartmann, Franz Fürbass, Georg Dorffner
ICONIP (3)4
2020 Investigating and Exploiting Image Resolution for Transfer Learning-based Skin Lesion Classification
abstract
Skin cancer is among the most common cancer types. Dermoscopic image analysis improves the diagnostic accuracy for detection of malignant melanoma and other pigmented skin lesions when compared to unaided visual inspection. Hence, computer-based methods to support medical experts in the diagnostic procedure are of great interest. Fine-tuning pre-trained convolutional neural networks (CNNs) has been shown to work well for skin lesion classification. Pre-trained CNNs are typically trained with natural images of a fixed image size significantly smaller than captured skin lesion images and consequently dermoscopic images are downsampled for fine-tuning. However, useful medical information may be lost during this transformation. In this paper, we explore the effect of input image size on skin lesion classification performance of fine-tuned CNNs. For this, we resize dermoscopic images to different resolutions, ranging from 64 × 64 to 768 × 768 pixels and investigate the resulting classification performance of three well-established CNNs, namely DenseNet-121, ResNet-18, and ResNet-50. Our results show that using very small images (of size 64 × 64 pixels) degrades the classification performance, while images of size 128 × 128 pixels and above support good performance with larger image sizes leading to slightly improved classification. We further propose a novel fusion approach based on a three-level ensemble strategy that exploits multiple fine-tuned networks trained with dermoscopic images at various sizes. When applied on the ISIC 2017 skin lesion classification challenge, our fusion approach yields an area under the receiver operating characteristic curve of 89.2% and 96.6% for melanoma classification and seborrheic keratosis classification, respectively, outperforming state-of-the-art algorithms.
Amirreza Mahbod, Gerald Schaefer, Chunliang Wang, Rupert Ecker, Georg Dorffner, Isabella Ellinger
ICPR5
2017 Bayesian Gaussian Process Classification from Event-Related Brain Potentials in Alzheimer's Disease
Wolfgang Fruehwirt, Pengfei Zhang 0001, Matthias Gerstgrasser, Dieter Grossegger, Reinhold Schmidt, Thomas Benke, Peter Dal-Bianco, Gerhard Ransmayr, Leonard Weydemann, Heinrich Garn, Markus Waser, Michael A. Osborne, Georg Dorffner
AIME13
2017 Echo State Networks as Novel Approach for Low-Cost Myoelectric Control
Cosima Prahm, Alexander Schulz 0001, Benjamin Paaßen, Oskar C. Aszmann, Barbara Hammer, Georg Dorffner
AIME6
2017 Estimation of Sleep Quality by Using Microstructure Profiles
Zuzana Rost'áková, Georg Dorffner, Onder Aydemir, Roman Rosipal
AIME2
2008 Neural Network Models for Conditional Distribution Under Bayesian Analysis
abstract
We use neural networks (NN) as a tool for a nonlinear autoregression to predict the second moment of the conditional density of return series. The NN models are compared to the popular econometric GARCH(1,1) model. We estimate the models in a Bayesian framework using Markov chain Monte Carlo posterior simulations. The interlinked aspects of the proposed Bayesian methodology are identification of NN hidden units and treatment of NN complexity based on model evidence. The empirical study includes the application of the designed strategy to market data, where we found a strong support for a nonlinear multilayer perceptron model with two hidden units.
Tatiana Miazhynskaia, Sylvia Frühwirth-Schnatter, Georg Dorffner
Neural Comput.3
2006 Learning Predictive Features in Affordance based Robotic Perception Systems
abstract
This work is about the relevance of Gibson's concept of affordances for visual perception in interactive and autonomous robotic systems. In extension to existing functional views on visual feature representations, we identify the importance of learning in perceptual cueing for the anticipation of opportunities for interaction of robotic agents. We investigate how the originally defined representational concept for the perception of affordances - in terms of using either optical flow or heuristically determined 3D features of perceptual entities should be generalized to using arbitrary visual feature representations. In this context we demonstrate the learning of causal relationships between visual cues and predictable interactions, and emphasize on a novel framework for cueing and hypothesis verification of affordances that could play an important role in future robot control architectures. We argue that affordance based perception should enable systems to react to environment stimuli both more efficient and autonomous, and provide a potential to plan on the basis of responses to more complex perceptual configurations. We verify the concept with a concrete implementation applying state-of-the-art visual descriptors and regions of interest within a simulated robot scenario and prove that these features were successfully selected for predicting opportunities of robot interaction
Gerald Fritz, Lucas Paletta, Ralph Breithaupt, Erich Rome, Georg Dorffner
IROS5
2005 A reliable probabilistic sleep stager based on a single EEG signal
Arthur Flexer, Georg Gruber, Georg Dorffner
Artif. Intell. Medicine3
2005 Using ICA for removal of ocular artifacts in EEG recorded from blind subjects
Arthur Flexer, Herbert Bauer, Jürgen Pripfl, Georg Dorffner
Neural Networks4
2003 Risk Management Application of the Recurrent Mixture Density Network Models
Tatiana Miazhynskaia, Georg Dorffner, Engelbert J. Dockner
ICANN2
2002 Continuous Unsupervised Sleep Staging Based on a Single EEG Signal
Arthur Flexer, Georg Gruber, Georg Dorffner
ICANN3
2001 Single Trial Estimation of Evoked Potentials Using Gaussian Mixture Models with Integrated Noise Component
Arthur Flexer, Herbert Bauer, Claus Lamm, Georg Dorffner
ICANN4
2001 A Probabilistic Approach to High-Resolution Sleep Analysis
Peter Sykacek, Stephen J. Roberts, Iead Rezek, Arthur Flexer, Georg Dorffner
ICANN5
2001 Predicting the Future of Discrete Sequences from Fractal Representations of the Past
Peter Tiño, Georg Dorffner
Mach. Learn.2
2001 Volatility Trading ia Temporal Pattern Recognition in Quantised Financial Time Series
Peter Tiño, Christian Schittenkopf, Georg Dorffner
Pattern Anal. Appl.3
2001 Risk-neutral density extraction from option prices: improved pricing with mixture density networks
abstract
One of the central goals in finance is to find better models for pricing and hedging financial derivatives such as call and put options. We present a new semi-nonparametric approach to risk-neutral density extraction from option prices, which is based on an extension of the concept of mixture density networks. The central idea is to model the shape of the risk-neutral density in a flexible, nonlinear way as a function of the time horizon. Thereby, stylized facts such as negative skewness and excess kurtosis are captured. The approach is applied to a very large set of intraday options data on the FTSE 100 recorded at LIFFE. It is shown to yield significantly better results in terms of out-of-sample pricing accuracy in comparison to the basic and an extended Black-Scholes model. It is also significantly better than a more elaborate GARCH option pricing model which includes a time-dependent volatility process. From the perspective of risk management, the extracted risk-neutral densities provide valuable information for value-at-risk estimations.
Christian Schittenkopf, Georg Dorffner
IEEE Trans. Neural Networks2
2001 Financial volatility trading using recurrent neural networks
abstract
We simulate daily trading of straddles on financial indexes. The straddles are traded based on predictions of daily volatility differences in the indexes. The main predictive models studied are recurrent neural nets (RNN). Such applications have often been studied in isolation. However, due to the special character of daily financial time-series, it is difficult to make full use of RNN representational power. Recurrent networks either tend to overestimate noisy data, or behave like finite-memory sources with shallow memory; they hardly beat classical fixed-order Markov models. To overcome data nonstationarity, we use a special technique that combines sophisticated models fitted on a larger data set, with a fixed set of simple-minded symbolic predictors using only recent inputs. Finally, we compare our predictors with the GARCH family of econometric models designed to capture time-dependent volatility structure in financial returns. GARCH models have been used to trade volatility. Experimental results show that while GARCH models cannot generate any significantly positive profit, by careful use of recurrent networks or Markov models, the market makers can generate a statistically significant excess profit, but then there is no reason to prefer RNN over much more simple and straightforward Markov models. We argue that any report containing RNN results on financial tasks should be accompanied by results achieved by simple finite-memory sources combined with simple techniques to fight nonstationarity in the data.
Peter Tiño, Christian Schittenkopf, Georg Dorffner
IEEE Trans. Neural Networks3
2000 The profitability of trading volatility using real-valued and symbolic models
abstract
There are two notions of volatility in literature: historical volatility and implied volatility. We concentrate on the latter by analyzing the profitability of a pure volatility trading strategy which is delta-neutral and independent of an option pricing model, for the German stock index DAX. Several very different methods ranging from linear and nonlinear, real-valued models to symbolic models of volatility changes are applied to predict the change in volatility to the next trading day and to gain profits by buying or selling straddles accordingly. The trading performance is evaluated for one historical and one implied volatility measure. The results are carefully evaluated concerning transaction costs, stationarity issues, and statistical significance. The main contribution of the paper is that, for the first time, the trading performance of models based on different modelling paradigms is compared.
Christian Schittenkopf, Peter Tiño, Georg Dorffner
CIFEr3
2000 Using Hidden Markov Models to Build an Automatic, Continuous and Probabilistic Sleep Stager
abstract
We report about an automatic continuous sleep stager which is based on probabilistic principles employing hidden Markov models (HMMs). Our sleep stager offers the advantage of being objective by not relying on human scorers, having much finer temporal resolution (1 second instead of 30 second): and being based on solid probabilistic principles rather than a predefined set of rules. Results obtained for nine whole night sleep recordings are reported.
Arthur Flexer, Peter Sykacek, Georg Dorffner, Iead Rezek
IJCNN (3)3
1999 Fat tails and non-linearity in volatility models: what is more important?
abstract
Since the seminal works of R.F. Engle (1982) and T. Bollerslev (1986) about heteroskedastic return series models, many extensions of their (G)ARCH models have been proposed in the literature. In particular, the functional dependence of conditional variances and the shape of the conditional distribution of returns have been varied in several ways (A.K. Bera and M.L. Higgins, 1993; T. Bollerslev et al., 1992). These two issues have been addressed by the neural network community using multi-layer perceptrons (MLPs) and mixture density networks (MDNs). We extend the concept of MDNs in a recurrent way to allow for "GARCH effects". These recurrent MDNs (RMDNs) offer a consistent framework to analyze the impact of nonlinearity and of non Gaussian (leptokurtic) conditional distributions on the explanatory power of volatility models. We present numerical experiments on a very large return data set, the size of which allows one to perform detailed statistical tests to compare the obtained results. In summary, conditional non Gaussian distributions (fat tails in the conditional distributions) tend to be more important than nonlinear specifications for conditional means and variances in the likelihood framework. With respect to other error measures however, the application of nonlinear neural networks seems to be promising. We think that the choice of a particular model for predicting volatility is closely related to the question of how to measure the prediction performance of a model.
Christian Schittenkopf, Georg Dorffner, Engelbert J. Dockner
CIFEr2
1999 Graded Grammaticality in Prediction Fractal Machines
Shan Parfitt, Peter Tiño, Georg Dorffner
NIPS3
1999 Building Predictive Models from Fractal Representations of Symbolic Sequences
Peter Tiño, Georg Dorffner
NIPS2
1998 Neural networks for recognizing patterns in cardiotocograms
Claudia Ulbricht, Georg Dorffner, Andreas Lee
Artif. Intell. Medicine2
1997 Experiences with Bayesian Learning in a Real World Application
Peter Sykacek, Georg Dorffner, Peter Rappelsberger, Josef Zeitlhofer
NIPS2
1997 Synergies between Statistical Data Analysis and Neural Networks in the Control of Rotary Blood Pumps
abstract
In this paper we report the application of multilayer perceptrons MLPs to three important tasks in the control of rotary blood pumps, namely the estimation of left atrium pressure and the indication of suction as well as danger of suction, in the left atrium. In order to select those tasks for which MLPs as nonlinear classifiers are truly appropriate, conventional techniques for statistical data analysis, such as principal component analysis PCA , were applied. Eleven parameters derived from actual measurements during the performance of the pump were available as input for the three tasks.
Georg Dorffner, Christian Stöcklmayer, Christian Schmidt 0009, Heinrich Schima
Cybern. Syst.1
1994 On using feedforward neural networks for clinical diagnostic tasks
Georg Dorffner, Gerold Porenta
Artif. Intell. Medicine1
1994 Why Connectionism and Language Modelling Need DETE
abstract
Abstract
Georg Dorffner
Connect. Sci.1
1992 On the Virtues of Functional Connectionist Compositionality
Georg Dorffner, Manfred Rotter
ECAI1
1990 Integrating Stress and Intonation into a Concept-to-Speech System
Georg Dorffner, Ernst Buchberger, Markus Kommenda
COLING1
1985 GRAPHON-the Vienna speech systhesis system for arbitrary German text
abstract
The text-to-speech system GRAPHON synthesizes speech from German text in two steps: first, a grapheme-to-phoneme conversion program derives the correct pronunciation by applying a set of about 600 rules. A currently developed morphological analysis component is expected to yield proper decomposition and pronunciation of compounds, assignment of word stress and extraction of syntax related information required to generate sentence intonation. The second step is phonetic-acoustic synthesis. A simplified articulatory model is used to control a refined digital vocal tract synthesizer. Operation of the whole text-to-speech system should be real-time.
Georg Dorffner, Markus Kommenda, Gernot Kubin
ICASSP1