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

Friedrich Leisch

dblp:48/5002 · DBLP profile ↗
← Back
13ranked-venue papers
3as first author
0since 2021 · last 2012
0000-0001-7278-1983ORCID · verified

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

Artificial intelligence and machine learning · 7 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 6

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.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%
Artificial intelligence
2 papers
Deep learning architectures and training · 21% Time series and sequential data · 21% Probabilistic and Bayesian machine learning · 21%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › gene expression analysis
gene expression clustering
0.222010
Mixtures of regression models for time course gene expression data: evaluation of initialization and random effects · Bioinform. 2010
gcExplorer: interactive exploration of gene clusters · Bioinform. 2009
Bioinformatics and computational biology
gene expression analysis
0.112012
Modelling time course gene expression data with finite mixtures of linear additive models · Bioinform. 2012
Bioinformatics and computational biology › gene expression analysis
gene expression modeling
0.112012
Modelling time course gene expression data with finite mixtures of linear additive models · Bioinform. 2012
Bioinformatics and computational biology › gene expression analysis
time series gene expression
0.112012
Modelling time course gene expression data with finite mixtures of linear additive models · Bioinform. 2012
Bioinformatics and computational biology › gene expression analysis
time course gene expression analysis
0.112010
Mixtures of regression models for time course gene expression data: evaluation of initialization and random effects · Bioinform. 2010
Visualization and visual analytics
interactive data exploration
0.012009
gcExplorer: interactive exploration of gene clusters · Bioinform. 2009
Machine learning › Deep learning architectures and training › sequence modeling
autoregressive neural networks
0.011998
Stationarity and Stability of Autoregressive Neural Network Processes · NIPS 1998
Robotics › Motion planning and robot control
stability analysis
0.011998
Stationarity and Stability of Autoregressive Neural Network Processes · NIPS 1998
Machine learning › Time series and sequential data › time series analysis
stationarity
0.011998
Stationarity and Stability of Autoregressive Neural Network Processes · NIPS 1998
Machine learning › Probabilistic and Bayesian machine learning
stochastic processes
0.011998
Stationarity and Stability of Autoregressive Neural Network Processes · NIPS 1998
Machine learning › Learning theory › classification
neural network classifier
0.011996
ARC-LH: A New Adaptive Resampling Algorithm for Improving ANN Classifiers · NIPS 1996

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

finite mixture model · 0.3cluster analysis · 0.2spline regression · 0.1regularized likelihood · 0.1simulation study · 0.1random effects · 0.1convergence analysis · 0.0resampling · 0.0
YearPublicationVenuePosition
2012 Modelling time course gene expression data with finite mixtures of linear additive models
abstract
UNLABELLED: A model class of finite mixtures of linear additive models is presented. The component-specific parameters in the regression models are estimated using regularized likelihood methods. The advantages of the regularization are that (i) the pre-specified maximum degrees of freedom for the splines is less crucial than for unregularized estimation and that (ii) for each component individually a suitable degree of freedom is selected in an automatic way. The performance is evaluated in a simulation study with artificial data as well as on a yeast cell cycle dataset of gene expression levels over time. AVAILABILITY: The latest release version of the R package flexmix is available from CRAN (http://cran.r-project.org/).
Bettina Grün, Theresa Scharl, Friedrich Leisch
Bioinform.3
2011 Case studies in reproducibility
abstract
Reproducible research is a concept of providing access to data and software along with published scientific findings. By means of some case studies from different disciplines, we will illustrate reasons why readers should be given the possibility to look at the data and software independently from the authors of the original publication. We report results of a survey comprising 100 papers recently published in Bioinformatics. The main finding is that authors of this journal share a culture of making data available. However, the number of papers where source code for simulation studies or analyzes is available is still rather limited.
Torsten Hothorn, Friedrich Leisch
Briefings Bioinform.2
2010 Mixtures of regression models for time course gene expression data: evaluation of initialization and random effects
abstract
SUMMARY: Finite mixture models are routinely applied to time course microarray data. Due to the complexity and size of this type of data, the choice of good starting values plays an important role. So far initialization strategies have only been investigated for data from a mixture of multivariate normal distributions. In this work several initialization procedures are evaluated for mixtures of regression models with and without random effects in an extensive simulation study on different artificial datasets. Finally, these procedures are also applied to a real dataset from Escherichia coli. AVAILABILITY: The latest release versions of R packages flexmix, gcExplorer and kernlab are always available from CRAN (http://cran.r-project.org/). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Theresa Scharl, Bettina Grün, Friedrich Leisch
Bioinform.3
2009 gcExplorer: interactive exploration of gene clusters
abstract
Abstract Summary: Cluster analysis plays an important role in the analysis of gene expression data since the early beginning of microarray studies and is routinely used to find groups of genes with common expression pattern. In order to make cluster analysis helpful for users, visualization of cluster solutions is of utmost importance. Here, we present the new R package gcExplorer for the interactive exploration of gene clusters. gcExplorer facilitates the interpretation of cluster results and allows to investigate extensive information about clusters. Availability: The latest release of gcExplorer is always available at the Comprehensive R Archive Network CRAN: http://cran.R-project.org/package=gcExplorer. See the README file in the package for detailed installation instructions. Contact: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.
Theresa Scharl, Friedrich Leisch
Bioinform.2
2009 Exploratory and inferential analysis of gene cluster neighborhood graphs
abstract
BACKGROUND: Many different cluster methods are frequently used in gene expression data analysis to find groups of co-expressed genes. However, cluster algorithms with the ability to visualize the resulting clusters are usually preferred. The visualization of gene clusters gives practitioners an understanding of the cluster structure of their data and makes it easier to interpret the cluster results. RESULTS: In this paper recent extensions of R package gcExplorer are presented. gcExplorer is an interactive visualization toolbox for the investigation of the overall cluster structure as well as single clusters. The different visualization options including arbitrary node and panel functions are described in detail. Finally the toolbox can be used to investigate the quality of a given clustering graphically as well as theoretically by testing the association between a partition and a functional group under study. CONCLUSION: It is shown that gcExplorer is a very helpful tool for a general exploration of microarray experiments. The identification of potentially interesting gene candidates or functional groups is substantially accelerated and eased. Inferential analysis on a cluster solution is used to judge its ability to provide insight into the underlying mechanistic biology of the experiment.
Theresa Scharl, Ingo Voglhuber, Friedrich Leisch
BMC Bioinform.3
2009 RGG: A general GUI Framework for R scripts
abstract
BACKGROUND: R is the leading open source statistics software with a vast number of biostatistical and bioinformatical analysis packages. To exploit the advantages of R, extensive scripting/programming skills are required. RESULTS: We have developed a software tool called R GUI Generator (RGG) which enables the easy generation of Graphical User Interfaces (GUIs) for the programming language R by adding a few Extensible Markup Language (XML) - tags. RGG consists of an XML-based GUI definition language and a Java-based GUI engine. GUIs are generated in runtime from defined GUI tags that are embedded into the R script. User-GUI input is returned to the R code and replaces the XML-tags. RGG files can be developed using any text editor. The current version of RGG is available as a stand-alone software (RGGRunner) and as a plug-in for JGR. CONCLUSION: RGG is a general GUI framework for R that has the potential to introduce R statistics (R packages, built-in functions and scripts) to users with limited programming skills and helps to bridge the gap between R developers and GUI-dependent users. RGG aims to abstract the GUI development from individual GUI toolkits by using an XML-based GUI definition language. Thus RGG can be easily integrated in any software. The RGG project further includes the development of a web-based repository for RGG-GUIs. RGG is an open source project licensed under the Lesser General Public License (LGPL) and can be downloaded freely at (http://rgg.r-forge.r-project.org).
Ilhami Visne, Erkan Dilaveroglu, Klemens Vierlinger, Martin Lauss, Ahmet Yildiz, Andreas Weinhäusel, Christa Noehammer, Friedrich Leisch, Albert Kriegner
BMC Bioinform.8
2003 The support vector machine under test
David Meyer, Friedrich Leisch, Kurt Hornik
Neurocomputing2
2001 Behavioral Market Segmentation of Binary Guest Survey Data with Bagged Clustering
Sara Dolnicar, Friedrich Leisch
ICANN2
2000 Stationary and Integrated Autoregressive Neural Network Processes
abstract
We consider autoregressive neural network (AR-NN) processes driven by additive noise and demonstrate that the characteristic roots of the shortcuts-the standard conditions from linear time-series analysis-determine the stochastic behavior of the overall AR-NN process. If all the characteristic roots are outside the unit circle, then the process is ergodic and stationary. If at least one characteristic root lies inside the unit circle, then the process is transient. AR-NN processes with characteristic roots lying on the unit circle exhibit either ergodic, random walk, or transient behavior. We also analyze the class of integrated AR-NN (ARI-NN) processes and show that a standardized ARI-NN process "converges" to a Wiener process. Finally, least-squares estimation (training) of the stationary models and testing for nonstationarity is discussed. The estimators are shown to be consistent, and expressions on the limiting distributions are given.
Adrian Trapletti, Friedrich Leisch, Kurt Hornik
Neural Comput.2
1998 Stationarity and Stability of Autoregressive Neural Network Processes
Friedrich Leisch, Adrian Trapletti, Kurt Hornik
NIPS1
1998 Cross-validation with active pattern selection for neural-network classifiers
abstract
We propose a new approach for leave-one-out cross-validation of neural-network classifiers called "cross-validation with active pattern selection" (CV/APS). In CV/APS, the contribution of the training patterns to network learning is estimated and this information is used for active selection of CV patterns. On the tested examples, the computational cost of CV can be drastically reduced with only small or no errors.
Friedrich Leisch, Lakhmi C. Jain, Kurt Hornik
IEEE Trans. Neural Networks1
1997 Adaptive combination of PCA and VQ networks
abstract
In this paper we consider the principal component analysis (PCA) and vector quantization (VQ) neural networks for image compression. We present a method where the PCA and VQ steps are adaptively combined. A learning algorithm for this combined network is derived. We demonstrate that this approach can improve the results of the successive application of the individually optimal methods.
Andreas Weingessel, Horst Bischof, Kurt Hornik, Friedrich Leisch
IEEE Trans. Neural Networks4
1996 ARC-LH: A New Adaptive Resampling Algorithm for Improving ANN Classifiers
Friedrich Leisch, Kurt Hornik
NIPS1