Demo Data from EDBT 2026 / reviewers in the wild / expert
Zacharias Papadovasilakis
dblp:262/3434
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0001-8255-5090ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021
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
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › statistical genetics › genomic prediction
genetic risk prediction |
0.7 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › genomics
genome-wide association study |
0.7 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › statistical genetics › genomic prediction
polygenic risk score |
0.7 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › statistical genetics › fine-mapping
causal variant identification |
0.2 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Bioinformatics and computational biology › clinical bioinformatics
genetic variant interpretation |
0.2 | 1 | 2023 | Automated machine learning for genome wide association studies · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
biosignature discovery · 0.7automated machine learning · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Automated machine learning for genome wide association studiesabstractMOTIVATION: Genome-wide association studies (GWAS) present several computational and statistical challenges for their data analysis, including knowledge discovery, interpretability, and translation to clinical practice. RESULTS: We develop, apply, and comparatively evaluate an automated machine learning (AutoML) approach, customized for genomic data that delivers reliable predictive and diagnostic models, the set of genetic variants that are important for predictions (called a biosignature), and an estimate of the out-of-sample predictive power. This AutoML approach discovers variants with higher predictive performance compared to standard GWAS methods, computes an individual risk prediction score, generalizes to new, unseen data, is shown to better differentiate causal variants from other highly correlated variants, and enhances knowledge discovery and interpretability by reporting multiple equivalent biosignatures. AVAILABILITY AND IMPLEMENTATION: Code for this study is available at: https://github.com/mensxmachina/autoML-GWAS. JADBio offers a free version at: https://jadbio.com/sign-up/. SNP data can be downloaded from the EGA repository (https://ega-archive.org/). PRS data are found at: https://www.aicrowd.com/challenges/opensnp-height-prediction. Simulation data to study population structure can be found at: https://easygwas.ethz.ch/data/public/dataset/view/1/. Kleanthi Lakiotaki, Zacharias Papadovasilakis, Vincenzo Lagani, Stefanos Fafalios, Paulos Charonyktakis, Michail Tsagris, Ioannis Tsamardinos |
Bioinform. | 2 |
| 2022 | The $\gamma$γ-OMP Algorithm for Feature Selection With Application to Gene Expression DataabstractFeature selection for predictive analytics is the problem of identifying a minimal-size subset of features that is maximally predictive of an outcome of interest. To apply to molecular data, feature selection algorithms need to be scalable to tens of thousands of features. In this paper, we propose γ-OMP, a generalisation of the highly-scalable Orthogonal Matching Pursuit feature selection algorithm. γ-OMP can handle (a)various types of outcomes, such as continuous, binary, nominal, time-to-event, (b)discrete (categorical)features, (c)different statistical-based stopping criteria, (d)several predictive models (e.g., linear or logistic regression), (e)various types of residuals, and (f)different types of association. We compare γ-OMP against LASSO, a prototypical, widely used algorithm for high-dimensional data. On both simulated data and several real gene expression datasets, γ-OMP is on par, or outperforms LASSO in binary classification (case-control data), regression (quantified outcomes), and time-to-event data (censored survival times). γ-OMP is based on simple statistical ideas, it is easy to implement and to extend, and our extensive evaluation shows that it is also effective in bioinformatics analysis settings. Michail Tsagris, Zacharias Papadovasilakis, Kleanthi Lakiotaki, Ioannis Tsamardinos |
IEEE ACM Trans. Comput. Biol. Bioinform. | 2 |