Demo Data from EDBT 2026 / reviewers in the wild / expert
Peter Sykacek
dblp:13/3632
· DBLP profile ↗
14ranked-venue papers
10as first author
0since 2021 · last 2012
0000-0001-8800-8354ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 6 first-authorApplied, interdisciplinary, general and emerging computing · 6 · 4 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.
| Interdisciplinary, comprehensive, and emerging computing
4 papers |
Bioinformatics and computational biology · 100% | |
| Artificial intelligence
5 papers |
Probabilistic and Bayesian machine learning · 80% Generative modeling · 12% Learning theory · 9% |
Topics — the 15 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › gene expression analysis
microarray data analysis |
0.2 | 3 | 2011 | Biological assessment of robust noise models in microarray data analysis · Bioinform. 2011 A friendly statistics package for microarray analysis · Bioinform. 2005 Bayesian modelling of shared gene function · Bioinform. 2007 |
Bioinformatics and computational biology › protein function prediction
gene ontology annotation |
0.1 | 1 | 2012 | Bayesian assignment of gene ontology terms to gene expression experiments · Bioinform. 2012 |
Bioinformatics and computational biology
gene expression analysis |
0.1 | 3 | 2012 | Bayesian assignment of gene ontology terms to gene expression experiments · Bioinform. 2012 Biological assessment of robust noise models in microarray data analysis · Bioinform. 2011 A friendly statistics package for microarray analysis · Bioinform. 2005 |
Bioinformatics and computational biology
bayesian modeling |
0.1 | 1 | 2007 | Bayesian modelling of shared gene function · Bioinform. 2007 |
Bioinformatics and computational biology › functional genomics
gene function analysis |
0.1 | 1 | 2007 | Bayesian modelling of shared gene function · Bioinform. 2007 |
Bioinformatics and computational biology › gene expression analysis › differential expression analysis
differentially expressed gene identification |
0.0 | 1 | 2011 | Biological assessment of robust noise models in microarray data analysis · Bioinform. 2011 |
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference |
0.0 | 1 | 2002 | Adaptive Classification by Variational Kalman Filtering · NIPS 2002 |
Machine learning › Generative modeling › generative model
generative classifier |
0.0 | 1 | 2001 | Bayesian time series classification · NIPS 2001 |
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
hidden markov model |
0.0 | 1 | 2001 | Bayesian time series classification · NIPS 2001 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian model selection |
0.0 | 1 | 1999 | On Input Selection with Reversible Jump Markov Chain Monte Carlo Sampling · NIPS 1999 |
Machine learning › Probabilistic and Bayesian machine learning
input selection |
0.0 | 1 | 1999 | On Input Selection with Reversible Jump Markov Chain Monte Carlo Sampling · NIPS 1999 |
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
reversible jump MCMC |
0.0 | 1 | 1999 | On Input Selection with Reversible Jump Markov Chain Monte Carlo Sampling · NIPS 1999 |
Machine learning › Learning theory › model selection
variable selection |
0.0 | 1 | 1999 | On Input Selection with Reversible Jump Markov Chain Monte Carlo Sampling · NIPS 1999 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian classification |
0.0 | 1 | 1998 | Bayesian Classifiers Are Large Margin Hyperplanes in a Hilbert Space · ICML 1998 |
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
bayesian inference |
0.0 | 1 | 1997 | Experiences with Bayesian Learning in a Real World Application · NIPS 1997 |
Methods — techniques the papers use, named apart from their topics
bayesian modeling · 0.1t-distribution · 0.1hierarchical bayesian analysis of variance · 0.1gaussian mixture model · 0.1hierarchical bayesian model · 0.1spike-based normalization · 0.1mixed model ANOVA · 0.1k nearest neighbour imputation · 0.1variational inference · 0.0sequential sampling · 0.0kalman filtering · 0.0markov chain monte carlo · 0.0autoregressive model · 0.0reversible jump markov chain monte carlo · 0.0bayesian learning · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Bayesian assignment of gene ontology terms to gene expression experimentsabstractMOTIVATION: Gene expression assays allow for genome scale analyses of molecular biological mechanisms. State-of-the-art data analysis provides lists of involved genes, either by calculating significance levels of mRNA abundance or by Bayesian assessments of gene activity. A common problem of such approaches is the difficulty of interpreting the biological implication of the resulting gene lists. This lead to an increased interest in methods for inferring high-level biological information. A common approach for representing high level information is by inferring gene ontology (GO) terms which may be attributed to the expression data experiment. RESULTS: This article proposes a probabilistic model for GO term inference. Modelling assumes that gene annotations to GO terms are available and gene involvement in an experiment is represented by a posterior probabilities over gene-specific indicator variables. Such probability measures result from many Bayesian approaches for expression data analysis. The proposed model combines these indicator probabilities in a probabilistic fashion and provides a probabilistic GO term assignment as a result. Experiments on synthetic and microarray data suggest that advantages of the proposed probabilistic GO term inference over statistical test-based approaches are in particular evident for sparsely annotated GO terms and in situations of large uncertainty about gene activity. Provided that appropriate annotations exist, the proposed approach is easily applied to inferring other high level assignments like pathways. AVAILABILITY: Source code under GPL license is available from the author. CONTACT: [email protected]. Peter Sykacek |
Bioinform. | 1 |
| 2011 | Biological assessment of robust noise models in microarray data analysisabstractMOTIVATION: Although several recently proposed analysis packages for microarray data can cope with heavy-tailed noise, many applications rely on Gaussian assumptions. Gaussian noise models foster computational efficiency. This comes, however, at the expense of increased sensitivity to outlying observations. Assessing potential insufficiencies of Gaussian noise in microarray data analysis is thus important and of general interest. RESULTS: We propose to this end assessing different noise models on a large number of microarray experiments. The goodness of fit of noise models is quantified by a hierarchical Bayesian analysis of variance model, which predicts normalized expression values as a mixture of a Gaussian density and t-distributions with adjustable degrees of freedom. Inference of differentially expressed genes is taken into consideration at a second mixing level. For attaining far reaching validity, our investigations cover a wide range of analysis platforms and experimental settings. As the most striking result, we find irrespective of the chosen preprocessing and normalization method in all experiments that a heavy-tailed noise model is a better fit than a simple Gaussian. Further investigations revealed that an appropriate choice of noise model has a considerable influence on biological interpretations drawn at the level of inferred genes and gene ontology terms. We conclude from our investigation that neglecting the over dispersed noise in microarray data can mislead scientific discovery and suggest that the convenience of Gaussian-based modelling should be replaced by non-parametric approaches or other methods that account for heavy-tailed noise. Alexandra Posekany, K. Felsenstein, Peter Sykacek |
Bioinform. | 3 |
| 2011 | An analysis of single amino acid repeats as use case for application specific background modelsabstractBACKGROUND: Sequence analysis aims to identify biologically relevant signals against a backdrop of functionally meaningless variation. Increasingly, it is recognized that the quality of the background model directly affects the performance of analyses. State-of-the-art approaches rely on classical sequence models that are adapted to the studied dataset. Although performing well in the analysis of globular protein domains, these models break down in regions of stronger compositional bias or low complexity. While these regions are typically filtered, there is increasing anecdotal evidence of functional roles. This motivates an exploration of more complex sequence models and application-specific approaches for the investigation of biased regions. RESULTS: Traditional Markov-chains and application-specific regression models are compared using the example of predicting runs of single amino acids, a particularly simple class of biased regions. Cross-fold validation experiments reveal that the alternative regression models capture the multi-variate trends well, despite their low dimensionality and in contrast even to higher-order Markov-predictors. We show how the significance of unusual observations can be computed for such empirical models. The power of a dedicated model in the detection of biologically interesting signals is then demonstrated in an analysis identifying the unexpected enrichment of contiguous leucine-repeats in signal-peptides. Considering different reference sets, we show how the question examined actually defines what constitutes the 'background'. Results can thus be highly sensitive to the choice of appropriate model training sets. Conversely, the choice of reference data determines the questions that can be investigated in an analysis. CONCLUSIONS: Using a specific case of studying biased regions as an example, we have demonstrated that the construction of application-specific background models is both necessary and feasible in a challenging sequence analysis situation. Pawel P. Labaj, Peter Sykacek, David P. Kreil |
BMC Bioinform. | 2 |
| 2011 | The impact of quantitative optimization of hybridization conditions on gene expression analysisabstractBACKGROUND: With the growing availability of entire genome sequences, an increasing number of scientists can exploit oligonucleotide microarrays for genome-scale expression studies. While probe-design is a major research area, relatively little work has been reported on the optimization of microarray protocols. RESULTS: As shown in this study, suboptimal conditions can have considerable impact on biologically relevant observations. For example, deviation from the optimal temperature by one degree Celsius lead to a loss of up to 44% of differentially expressed genes identified. While genes from thousands of Gene Ontology categories were affected, transcription factors and other low-copy-number regulators were disproportionately lost. Calibrated protocols are thus required in order to take full advantage of the large dynamic range of microarrays.For an objective optimization of protocols we introduce an approach that maximizes the amount of information obtained per experiment. A comparison of two typical samples is sufficient for this calibration. We can ensure, however, that optimization results are independent of the samples and the specific measures used for calibration. Both simulations and spike-in experiments confirmed an unbiased determination of generally optimal experimental conditions. CONCLUSIONS: Well calibrated hybridization conditions are thus easily achieved and necessary for the efficient detection of differential expression. They are essential for the sensitive pro filing of low-copy-number molecules. This is particularly critical for studies of transcription factor expression, or the inference and study of regulatory networks. Peter Sykacek, David P. Kreil, Lisa A. Meadows, Richard P. Auburn, Bettina Fischer, Steven Russell, Gos Micklem |
BMC Bioinform. | 1 |
| 2007 | Bayesian modelling of shared gene functionabstractMOTIVATION: Biological assays are often carried out on tissues that contain many cell lineages and active pathways. Microarray data produced using such material therefore reflect superimpositions of biological processes. Analysing such data for shared gene function by means of well-matched assays may help to provide a better focus on specific cell types and processes. The identification of genes that behave similarly in different biological systems also has the potential to reveal new insights into preserved biological mechanisms. RESULTS: In this article, we propose a hierarchical Bayesian model allowing integrated analysis of several microarray data sets for shared gene function. Each gene is associated with an indicator variable that selects whether binary class labels are predicted from expression values or by a classifier which is common to all genes. Each indicator selects the component models for all involved data sets simultaneously. A quantitative measure of shared gene function is obtained by inferring a probability measure over these indicators. Through experiments on synthetic data, we illustrate potential advantages of this Bayesian approach over a standard method. A shared analysis of matched microarray experiments covering (a) a cycle of mouse mammary gland development and (b) the process of in vitro endothelial cell apoptosis is proposed as a biological gold standard. Several useful sanity checks are introduced during data analysis, and we confirm the prior biological belief that shared apoptosis events occur in both systems. We conclude that a Bayesian analysis for shared gene function has the potential to reveal new biological insights, unobtainable by other means. AVAILABILITY: An online supplement and MatLab code are available at http://www.sykacek.net/research.html#mcabf Peter Sykacek, R. Clarkson, Cristin G. Print, R. A. Furlong, Gos Micklem |
Bioinform. | 1 |
| 2005 | A friendly statistics package for microarray analysisabstractSUMMARY: The friendly statistics package for microarray analysis (FSPMA) is a tool that aims to fill the gap between simple to use and powerful analysis. FSPMA is a platform-independent R-package that allows efficient exploration of microarray data without the need for computer programming. Analysis is based on a mixed model ANOVA library (YASMA) that was extended to allow more flexible comparisons and other useful operations like k nearest neighbour imputing and spike-based normalization. Processing is controlled by a definition file that specifies all the steps necessary to derive analysis results from quantified microarray data. In addition to providing analysis without programming, the definition file also serves as exact documentation of all the analysis steps. AVAILABILITY: The library is available under GPL 2 license and, together with additional information, provided at http://www.ccbi.cam.ac.uk/software/psyk/software.html#fspma Peter Sykacek, R. A. Furlong, Gos Micklem |
Bioinform. | 1 |
| 2002 | Adaptive Classification by Variational Kalman FilteringabstractWe propose in this paper a probabilistic approach for adaptive inference of generalized nonlinear classification that combines the computational advantage of a parametric solution with the flexibility of sequential sam- pling techniques. We regard the parameters of the classifier as latent states in a first order Markov process and propose an algorithm which can be regarded as variational generalization of standard Kalman filter- ing. The variational Kalman filter is based on two novel lower bounds that enable us to use a non-degenerate distribution over the adaptation rate. An extensive empirical evaluation demonstrates that the proposed method is capable of infering competitive classifiers both in stationary and non-stationary environments. Although we focus on classification, the algorithm is easily extended to other generalized nonlinear models. Peter Sykacek, Stephen J. Roberts |
NIPS | 1 |
| 2001 | A Probabilistic Approach to High-Resolution Sleep Analysis
Peter Sykacek, Stephen J. Roberts, Iead Rezek, Arthur Flexer, Georg Dorffner |
ICANN | 1 |
| 2001 | Bayesian time series classificationabstractThis paper proposes an approach to classification of adjacent segments of a time series as being either of classes. We use a hierarchical model that consists of a feature extraction stage and a generative classifier which is built on top of these features. Such two stage approaches are often used in signal and image processing. The novel part of our work is that we link these stages probabilistically by using a latent feature space. To use one joint model is a Bayesian requirement, which has the advantage to fuse information according to its certainty. The classifier is implemented as hidden Markov model with Gaussian and Multinomial observation distributions defined on a suitably chosen representation of autoregressive models. The Markov dependency is mo- tivated by the assumption that successive classifications will be corre- lated. Inference is done with Markov chain Monte Carlo (MCMC) tech- niques. We apply the proposed approach to synthetic data and to classi- fication of EEG that was recorded while the subjects performed different cognitive tasks. All experiments show that using a latent feature space results in a significant improvement in generalization accuracy. Hence we expect that this idea generalizes well to other hierarchical models. Peter Sykacek, Stephen J. Roberts |
NIPS | 1 |
| 2000 | Using Hidden Markov Models to Build an Automatic, Continuous and Probabilistic Sleep StagerabstractWe 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) | 2 |
| 1999 | On Input Selection with Reversible Jump Markov Chain Monte Carlo Sampling
Peter Sykacek |
NIPS | 1 |
| 1998 | Bayesian Classifiers Are Large Margin Hyperplanes in a Hilbert Space
Nello Cristianini, John Shawe-Taylor, Peter Sykacek |
ICML | 3 |
| 1997 | Equivalent error bars for neural network classifiers trained by Bayesian inference
Peter Sykacek |
ESANN | 1 |
| 1997 | Experiences with Bayesian Learning in a Real World Application
Peter Sykacek, Georg Dorffner, Peter Rappelsberger, Josef Zeitlhofer |
NIPS | 1 |