Demo Data from EDBT 2026 / reviewers in the wild / expert
David P. Kreil
dblp:15/1642
· DBLP profile ↗
16ranked-venue papers
3as first author
6since 2021 · last 2025
0000-0001-7538-2056ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 12 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 4 · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Systems, 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
2 papers |
Representation and self-supervised learning · 77% Deep learning architectures and training · 17% Transfer learning and domain adaptation · 6% | |
| Interdisciplinary, comprehensive, and emerging computing
4 papers |
Bioinformatics and computational biology · 100% |
Topics — the 12 heaviest of 13, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Representation and self-supervised learning
contrastive learning |
0.6 | 1 | 2022 | CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022 |
Machine learning › Representation and self-supervised learning › associative memory
modern hopfield model |
0.6 | 1 | 2022 | CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022 |
Machine learning › Representation and self-supervised learning
multimodal representation learning |
0.6 | 1 | 2022 | CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022 |
Machine learning › Representation and self-supervised learning
associative memory |
0.5 | 1 | 2021 | Hopfield Networks is All You Need · ICLR 2021 |
Machine learning › Deep learning architectures and training › recurrent neural network
hopfield network |
0.5 | 1 | 2021 | Hopfield Networks is All You Need · ICLR 2021 |
Machine learning › Transfer learning and domain adaptation
zero-shot transfer |
0.2 | 1 | 2022 | CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIP · NeurIPS 2022 |
Bioinformatics and computational biology › proteomics › proteome comparison
differential protein expression analysis |
0.0 | 1 | 2004 | DNA microarray normalization methods can remove bias from differential protein expression analysis of 2D difference gel electrophoresis results · Bioinform. 2004 |
Bioinformatics and computational biology
proteomics |
0.0 | 1 | 2004 | DNA microarray normalization methods can remove bias from differential protein expression analysis of 2D difference gel electrophoresis results · Bioinform. 2004 |
Bioinformatics and computational biology
protein sequence analysis |
0.0 | 1 | 2003 | Comparison of sequence masking algorithms and the detection of biased protein sequence regions · Bioinform. 2003 |
Bioinformatics and computational biology › gene expression analysis
differential expression analysis |
0.0 | 1 | 2011 | Characterization and improvement of RNA-Seq precision in quantitative transcript expression profiling · Bioinform. 2011 |
Bioinformatics and computational biology › protein sequence analysis › protein sequence annotation
low complexity region analysis |
0.0 | 1 | 2000 | CAST: an iterative algorithm for the complexity analysis of sequence tracts · Bioinform. 2000 |
Bioinformatics and computational biology
sequence analysis |
0.0 | 1 | 2000 | CAST: an iterative algorithm for the complexity analysis of sequence tracts · Bioinform. 2000 |
Methods — techniques the papers use, named apart from their topics
modern hopfield networks · 0.6InfoNCE · 0.6InfoLOOB · 0.6energy-based model · 0.5attention mechanism · 0.5read mapping and quantification · 0.1variance stabilizing transforms · 0.0robust z-score · 0.0normalization · 0.0sequence masking algorithms · 0.0randomization testing · 0.0smith-waterman alignment · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Bottlenecks in advancing and applying multiomic data integration - common data resources as rate-limiting drivers - the high-impact use case of atherosclerotic cardiovascular diseaseabstractDespite striking successes in identifying novel biomarkers for improved patient stratification and predicting disease progression, numerous challenges remain in the effective integration and exploitation of multiomic data in biomedical applications beyond cancer, for which most bioinformatics strategies are developed and validated. That focus on cancer severely limits the effective development and advancement of algorithms in machine learning and artificial intelligence that do not suffer degraded out-of-domain performance. Generalizability and interpretability of models, however, are also required for robust insights that may translate into clinical practice. Work across different independent datasets is critical for establishing models robust towards unwanted variation in assays, protocols, and cohort populations. Disease-specific context like ethnicity, socioeconomic background, sex, lifestyle, disease phase, and tissue type also strongly affect molecular profiles. We here discuss atherosclerotic cardiovascular disease (ASCVD) as a high-impact non-cancer use case for the challenges remaining in the development and application of the latest bioinformatics approaches to multiomics data integration. ASCVD remains the leading cause of death globally. Disease aetiology, progression, and therapy outcome depend on a complex interplay of genetic, environmental, and lifestyle factors. Integrating these diverse data types effectively remains a challenge but holds transformative potential for personalized medicine. Discovery and access to data of sufficient diversity and extent form key bottlenecks. We here compile a first comprehensive overview of key data sets in ASCVD to complement the established cancer-focused resources as a foundation for future effective development and application of state-of-the-art bioinformatics tools for multiomic data integration. Stephanie Bezzina Wettinger, Kanita Karaduzovic-Hadziabdic, Ritienne Attard, Rosienne Farrugia, Brooke N. Wolford, Marco Chierici, Giuseppe Jurman, Panagiotis Alexiou, José L. Peñalvo, Rafael S. Costa, José Basilio, Frantisek Sabovcik, Rui Vitorino, Johannes A. Schmid, Rajesh Shigdel, Baiba Vilne, Artemis G. Hatzigeorgiou, Miron Sopic, Yvan Devaux, Paolo Magni, Maria Tellez-Plaza, David P. Kreil, Aleksandra Gruca |
Briefings Bioinform. | 22 |
| 2022 | CLOOB: Modern Hopfield Networks with InfoLOOB Outperform CLIPabstractCLIP yielded impressive results on zero-shot transfer learning tasks and is considered as a foundation model like BERT or GPT3. CLIP vision models that have a rich representation are pre-trained using the InfoNCE objective and natural language supervision before they are fine-tuned on particular tasks. Though CLIP excels at zero-shot transfer learning, it suffers from an explaining away problem, that is, it focuses on one or few features, while neglecting other relevant features. This problem is caused by insufficiently extracting the covariance structure in the original multi-modal data. We suggest to use modern Hopfield networks to tackle the problem of explaining away. Their retrieved embeddings have an enriched covariance structure derived from co-occurrences of features in the stored embeddings. However, modern Hopfield networks increase the saturation effect of the InfoNCE objective which hampers learning. We propose to use the InfoLOOB objective to mitigate this saturation effect. We introduce the novel "Contrastive Leave One Out Boost" (CLOOB), which uses modern Hopfield networks for covariance enrichment together with the InfoLOOB objective. In experiments we compare CLOOB to CLIP after pre-training on the Conceptual Captions and the YFCC dataset with respect to their zero-shot transfer learning performance on other datasets. CLOOB consistently outperforms CLIP at zero-shot transfer learning across all considered architectures and datasets. Andreas Fürst, Elisabeth Rumetshofer, Johannes Lehner, Viet T. Tran, Hubert Ramsauer, David P. Kreil, Michael Kopp 0001, Günter Klambauer, Angela Bitto-Nemling, Sepp Hochreiter |
NeurIPS | 7 |
| 2022 | Landslide4Sense: Reference Benchmark Data and Deep Learning Models for Landslide DetectionabstractThis study introducesLandslide4Sense, a reference benchmark for landslide detection from remote sensing. The repository features 3,799 image patches fusing optical layers from Sentinel-2 sensors with the digital elevation model and slope layer derived from ALOS PALSAR. The added topographical information facilitates an accurate detection of landslide borders, which recent researches have shown to be challenging using optical data alone. The extensive data set supports deep learning (DL) studies in landslide detection and the development and validation of methods for the systematic update of landslide inventories. The benchmark data set has been collected at four different times and geographical locations: Iburi (September 2018), Kodagu (August 2018), Gorkha (April 2015), and Taiwan (August 2009). Each image pixel is labelled as belonging to a landslide or not, incorporating various sources and thorough manual annotation. We then evaluate the landslide detection performance of 11 state-of-the-art DL segmentation models: U-Net, ResU-Net, PSPNet, ContextNet, DeepLab-v2, DeepLab-v3+, FCN-8s, LinkNet, FRRN-A, FRRN-B, and SQNet. All models were trained from scratch on patches from one quarter of each study area and tested on independent patches from the other three quarters. Our experiments demonstrate that ResU-Net outperformed the other models for the landslide detection task. We make the multi-source landslide benchmark data (Landslide4Sense) and the tested DL models publicly available at https://www.iarai.ac.at/landslide4sense, establishing an important resource for remote sensing, computer vision, and machine learning communities in studies of image classification in general and applications to landslide detection in particular. Omid Ghorbanzadeh, Yonghao Xu, Pedram Ghamisi, Michael Kopp 0001, David P. Kreil |
IEEE Trans. Geosci. Remote. Sens. | 5 |
| 2021 | High-resolution multi-channel weather forecasting - First insights on transfer learning from the Weather4cast Competitions 2021abstractWeather forecasting is both a high impact application as well as a complex Big Data modelling challenge. Recent advances in machine learning have already demonstrated the power of non-physical modelling approaches for the prediction of rainfall. The Weather4cast competitions now provide a unique multi-channel benchmark for the prediction of up to 8 hours of weather with high temporal and spatial resolutions (15 min, 4 km) for a diverse set of large regions across Earth. This diversity, for the first time, also permits a meaningful spatial transfer learning challenge in weather forecasting.Weather4cast introduces multi-channel weather ‘movies’ that encode temperature, rainfall, cloud properties, and turbulence as derived from the meteorological satellites by the EUMETSAT NWC SAF. Inspired by the Traffic4cast competitions at the NeurIPS conferences in 2019 and 2020, weather forecasting is thus presented as a video frame prediction task. As then, the U-Net based models developed for photographic image analysis intriguingly did well on these artificial videos. In contrast, however, the winning submission did not employ a U-Net but a recurrent convolutional network with residual units.Weather4cast introduces the first spatial transfer learning challenge in weather forecasting: only one-hour short snippets from spatial regions never seen before were provided as input to models. We can thus now present first insights from submissions to this spatial transfer learning challenge. Notably, models with better core prediction performance also generalized better. Moreover, the two top-ranked models – one RCN based, one U-Net based – were further ahead of the remaining top-ranked submissions for spatial transfer learning (+6%) than in the core prediction challenge (+1%).While submissions tested varying strategies for input data selection and training, there remains a wide range of additional complementary approaches to be explored in future analyses. The competition and its leaderboards remain available and open for new submissions on the weather4cast.ai website. Pedro Herruzo, Aleksandra Gruca, Llorenç Lliso, Xavier Calbet, Pilar Rípodas, Sepp Hochreiter, Michael Kopp 0001, David P. Kreil |
IEEE BigData | 8 |
| 2021 | CDCEO'21 - First Workshop on Complex Data Challenges in Earth ObservationabstractHigh-resolution remote sensing technology for Earth Observation (EO) has radically changed how we monitor the state of our planet around the clock. An effective interpretation of the resulting complex large-scale time series adopts the best machine learning techniques from signal processing, computer vision, pattern recognition, and artificial intelligence. The First Workshop on Complex Data Challenges in Earth Observation was open to both method development and advanced applications in a wide range of related topics, including image and signal processing, gap-filling, data fusion, feature extraction, prediction of spatio-temporal features, and the detection of rules underlying the observed state transitions and causal relationships. The full agenda, featuring keynotes and a selection of high quality contributed talks is available online at www.iarai.ac.at/cdceo21 Aleksandra Gruca, Pedro Herruzo, Pilar Rípodas, Andrzej Kucik, Christian Briese, Michael Kopp 0001, Sepp Hochreiter, Pedram Ghamisi, David P. Kreil |
CIKM | 9 |
| 2021 | Hopfield Networks is All You Need
Hubert Ramsauer, Bernhard Schäfl, Johannes Lehner, Philipp Seidl, Michael Widrich, Lukas Gruber, Markus Holzleitner, Thomas Adler, David P. Kreil, Michael Kopp 0001, Günter Klambauer, Johannes Brandstetter, Sepp Hochreiter |
ICLR | 9 |
| 2013 | Managing and Optimizing Bioinformatics Workflows for Data Analysis in Clouds
Vincent C. Emeakaroha, Michael Maurer, Patrick Stern, Pawel P. Labaj, Ivona Brandic, David P. Kreil |
J. Grid Comput. | 6 |
| 2011 | Characterization and improvement of RNA-Seq precision in quantitative transcript expression profilingabstractMOTIVATION: Measurement precision determines the power of any analysis to reliably identify significant signals, such as in screens for differential expression, independent of whether the experimental design incorporates replicates or not. With the compilation of large-scale RNA-Seq datasets with technical replicate samples, however, we can now, for the first time, perform a systematic analysis of the precision of expression level estimates from massively parallel sequencing technology. This then allows considerations for its improvement by computational or experimental means. RESULTS: We report on a comprehensive study of target identification and measurement precision, including their dependence on transcript expression levels, read depth and other parameters. In particular, an impressive recall of 84% of the estimated true transcript population could be achieved with 331 million 50 bp reads, with diminishing returns from longer read lengths and even less gains from increased sequencing depths. Most of the measurement power (75%) is spent on only 7% of the known transcriptome, however, making less strongly expressed transcripts harder to measure. Consequently, <30% of all transcripts could be quantified reliably with a relative error<20%. Based on established tools, we then introduce a new approach for mapping and analysing sequencing reads that yields substantially improved performance in gene expression profiling, increasing the number of transcripts that can reliably be quantified to over 40%. Extrapolations to higher sequencing depths highlight the need for efficient complementary steps. In discussion we outline possible experimental and computational strategies for further improvements in quantification precision. CONTACT: [email protected] Pawel P. Labaj, Germán G. Leparc, Bryan E. Linggi, Lye Meng Markillie, H. Steven Wiley, David P. Kreil |
Bioinform. | 6 |
| 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. | 3 |
| 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. | 2 |
| 2010 | Hybridization thermodynamics of NimbleGen MicroarraysabstractBACKGROUND: While microarrays are the predominant method for gene expression profiling, probe signal variation is still an area of active research. Probe signal is sequence dependent and affected by probe-target binding strength and the competing formation of probe-probe dimers and secondary structures in probes and targets. RESULTS: We demonstrate the benefits of an improved model for microarray hybridization and assess the relative contributions of the probe-target binding strength and the different competing structures. Remarkably, specific and unspecific hybridization were apparently driven by different energetic contributions: For unspecific hybridization, the melting temperature Tm was the best predictor of signal variation. For specific hybridization, however, the effective interaction energy that fully considered competing structures was twice as powerful a predictor of probe signal variation. We show that this was largely due to the effects of secondary structures in the probe and target molecules. The predictive power of the strength of these intramolecular structures was already comparable to that of the melting temperature or the free energy of the probe-target duplex. CONCLUSIONS: This analysis illustrates the importance of considering both the effects of probe-target binding strength and the different competing structures. For specific hybridization, the secondary structures of probe and target molecules turn out to be at least as important as the probe-target binding strength for an understanding of the observed microarray signal intensities. Besides their relevance for the design of new arrays, our results demonstrate the value of improving thermodynamic models for the read-out and interpretation of microarray signals. Ulrike Mückstein, Germán G. Leparc, Alexandra Posekany, Ivo L. Hofacker, David P. Kreil |
BMC Bioinform. | 5 |
| 2008 | BibGlimpse: The case for a light-weight reprint manager in distributed literature researchabstractBACKGROUND: While text-mining and distributed annotation systems both aim at capturing knowledge and presenting it in a standardized form, there have been few attempts to investigate potential synergies between these two fields. For instance, distributed annotation would be very well suited for providing topic focussed, expert knowledge enriched text corpora. A key limitation for this approach is the availability of literature annotation systems that can be routinely used by groups of collaborating researchers on a day to day basis, not distracting from the main focus of their work. RESULTS: For this purpose, we have designed BibGlimpse. Features like drop-to-file, SVM based automated retrieval of PubMed bibliography for PDF reprints, and annotation support make BibGlimpse an efficient, light-weight reprint manager that facilitates distributed literature research for work groups. Building on an established open search engine, full-text search and structured queries are supported, while at the same time making shared collections of annotated reprints accessible to literature classification and text-mining tools. CONCLUSION: BibGlimpse offers scientists a tool that enhances their own literature management. Moreover, it may be used to create content enriched, annotated text corpora for research in text-mining. Thomas Tüchler, Golda Velez, Alexandra Graf, David P. Kreil |
BMC Bioinform. | 4 |
| 2005 | There is no silver bullet - a guide to low-level data transforms and normalisation methods for microarray dataabstractTo overcome random experimental variation, even for simple screens, data from multiple microarrays have to be combined. There are, however, systematic differences between arrays, and any bias remaining after experimental measures to ensure consistency needs to be controlled for. It is often difficult to make the right choice of data transformation and normalisation methods to achieve this end. In this tutorial paper we review the problem and a selection of solutions, explaining the basic principles behind normalisation procedures and providing guidance for their application. David P. Kreil, Roslin Russell |
Briefings Bioinform. | 1 |
| 2004 | DNA microarray normalization methods can remove bias from differential protein expression analysis of 2D difference gel electrophoresis resultsabstractMOTIVATION: Two-dimensional Difference Gel Electrophoresis (DIGE) measures expression differences for thousands of proteins in parallel. In contrast to DNA microarray analysis, however, there have been few systematic studies on the validity of differential protein expression analysis, and the effects of normalization methods have not yet been investigated. To address this need, we assessed a series of same-same comparisons, evaluating how random experimental variance influenced differential expression analysis. RESULTS: The strong fluctuations observed were reflected in large discrepancies between the distributions of the spot intensities for different gels. Correct normalization for pooling of multiple gels for analysis is, therefore, essential. We show that both dye-specific background levels and the differences in scale of the spot intensity distributions must be accounted for. A variance stabilizing transform that had been developed for DNA microarray analysis combined with a robust Z-score allowed the determination of gel-independent signal thresholds based on the empirical distributions from same-same comparisons. In contrast, similar thresholds holding up to cross-validation could not be proposed for data normalized using methods established in the field of proteomics. AVAILABILITY: Software is available on request from the authors. SUPPLEMENTARY INFORMATION: There is supplementary material available online at http://www.flychip.org.uk/kreil/pub/2dgels/ David P. Kreil, Natasha A. Karp, Kathryn S. Lilley |
Bioinform. | 1 |
| 2003 | Comparison of sequence masking algorithms and the detection of biased protein sequence regionsabstractMOTIVATION: Separation of protein sequence regions according to their local information complexity and subsequent masking of low complexity regions has greatly enhanced the reliability of function prediction by sequence similarity. Comparisons with alternative methods that focus on compositional sequence bias rather than information complexity measures have shown that removal of compositional bias yields at least as sensitive and much more specific results. Besides the application of sequence masking algorithms to sequence similarity searches, the study of the masked regions themselves is of great interest. Traditionally, however, these have been neglected despite evidence of their functional relevance. RESULTS: Here we demonstrate that compositional bias seems to be a more effective measure for the detection of biologically meaningful signals. Typical results on proteins are compared to results for sequences that have been randomized in various ways, conserving composition and local correlations for individual proteins or the entire set. It is remarkable that low-complexity regions have the same form of distribution in proteins as in randomized sequences, and that the signal from randomized sequences with conserved local correlations and amino acid composition almost matches the signal from proteins. This is not the case for sequence bias, which hence seems to be a genuinely biological phenomenon in contrast to patches of low complexity. David P. Kreil, Christos A. Ouzounis |
Bioinform. | 1 |
| 2000 | CAST: an iterative algorithm for the complexity analysis of sequence tractsabstractMOTIVATION: Sensitive detection and masking of low-complexity regions in protein sequences. Filtered sequences can be used in sequence comparison without the risk of matching compositionally biased regions. The main advantage of the method over similar approaches is the selective masking of single residue types without affecting other, possibly important, regions. RESULTS: A novel algorithm for low-complexity region detection and selective masking. The algorithm is based on multiple-pass Smith-Waterman comparison of the query sequence against twenty homopolymers with infinite gap penalties. The output of the algorithm is both the masked query sequence for further analysis, e.g. database searches, as well as the regions of low complexity. The detection of low-complexity regions is highly specific for single residue types. It is shown that this approach is sufficient for masking database query sequences without generating false positives. The algorithm is benchmarked against widely available algorithms using the 210 genes of Plasmodium falciparum chromosome 2, a dataset known to contain a large number of low-complexity regions. AVAILABILITY: CAST (version 1.0) executable binaries are available to academic users free of charge under license. Web site entry point, server and additional material: http://www.ebi.ac.uk/research/cgg/services/cast/ Vasilis J. Promponas, Anton J. Enright, Sophia Tsoka, David P. Kreil, Christophe Leroy, Stavros J. Hamodrakas, Chris Sander, Christos A. Ouzounis |
Bioinform. | 4 |